What is resource allocation graph? Explain the process of detecting deadlocks when there is single instance of each resources with suitable example?

Question

Suresh Chand · Accepted Answer

The resource allocation graph is a directed graph that briefs about the deadlock more precisely. This is the principal representation showing processes requested resources and assigned resources. In RAG, vertices and edges are present. Vertices are of two types: Process vertex Resource vertex and resources are of two types Single instance Multiple instances Let's take an example of a single instance of RAG Here, we can see in fig(i), If there is a cycle in RAG and each resource in the cycle provides only one instance, then the process will be in a deadlock. In fig (2), there is no deadlock because there is no circular dependency. So, a cycle in a single instance resource type is a sufficient condition for deadlock.

What is resource allocation graph? Explain the process of detecting deadlocks when there is single instance of each resources with suitable example?

Leave your Answer:

Hits Counter

Question

What is resource allocation graph? Explain the process of detecting deadlocks when there is single instance of each resources with suitable example?

Leave your Answer: