RESOURCE ALLOCATION GRAPH

RESOURCE ALLOCATION GRAPH-
-a set of vertices V and a set of edges E.
--v is partitioned into two types:
-P={P1,P2....Pn},the set consisting of all the processes in the system,
-R={R1,R2....Rm},the set consisting of all resource types in the system.
--requests edge-directed edge P1->R1
--assignment edge-directed edge R1->P1





how would you know if there's a deadlock based on the resource allocation graph?

-if the graph contains no cycle=>no deadlock
-if the graph contains a cycle-
---if only one instance per resource type,then deadlock.
---if several instance per resource type.possibility of deadlock.