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.


• request edge – directed edge P1 => Rj
  


• assignment edge – directed edge Rj => Pi