Resource Allocation Graph

-A set of vertices and set of edge E.

• V is partitioned into two types:

1. P = {P1, P2,...Pn}, the set consisting of all the processes in the system.
2. R = {R1, R2,...Rm}, the set consisting of all the resource types in the system.
   

• request edge - directed edge P1 - Rj
  
• assignment edge - directed edge Rj - Pi

Q: How would you know if there's a deadlock in the reasource allocation graph?

A: You would know if there's a deadlock in the allocation graph if graphs contains a cycle and only if one instnace p[er reource type, then deadlock and only if several intances per resource type, possibility of deadlock.