Operating Systems20785 marksHandling Deadlocks
What is resource allocation graph? Explain the process of detecting deadlocks when there is single instance of each resources with suitable example?
What is resource allocation graph? Explain the process of detecting deadlocks when there is single instance of each resources with suitable example? [5]
A Resource Allocation Graph is a directed graph used to precisely describe and detect deadlocks in a system. It consists of: - Vertices (V): Two types: - P = {P1, P2, ..., Pn} - set of all active processes (represented as circles) - R = {R1, R2, ..., Rm} - set of all resource types (represented a...