7.2.2 Resource-Allocation Graph (cont.)
§7.2 Deadlock Characterization (cont.)
7.2.2 Resource-allocation graph
A system resource allocation graph is a directed graph and consists of 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.
November 2013
Operating System Concepts - Chapter 7 Deadlocks - 6
§7.1 System Model
System model resource-allocation model
Finite number of resources in systems, resource types R1, R2, . . ., Rm physical resources, e.g., CPU cycles, memory space, I/O devices logical resources, e.g., files, semaphores, monitors
no preemption