7.8 Silberschatz, Galvin and Gagne ©2010 Operating System Concepts – 8 th Edition Resource-Allocation Graph V is partitioned into two types: P = {P 1, P 2, …, P n }, the set consisting of all the processes in the system R = {R 1, R 2, …, R m }, the set consisting of all resource types in the system A request edge – directed edge P 1  R j An assignment edge – directed edge R j  P i A set of vertices V and a set of edges E.
{}