Resource Allocation Graph

Resource-Allocation Graph Deadlocks can be described in terms of a directed graph called a system resource-allocation graph. This graph consists of a set of vertices V and a set of edges E. The set of vertices V is partitioned into two different types of nodes P = {PI, P2, …, Pn}, the set consisting of… Continue reading Resource Allocation Graph