6.1.3 Resource Allocation Graphs(1/4) Deadlocks can be described using resource allocation graph · Vertices Active processes (Pl, P2,...) · Resources R1,R2,…} Edges a directed edge from pi to r Process Pi requested an instance of resource Rj a directed edge from ri to pi Resource ri has been allocated to process pi Process are circles resources are rectangles6.1.3 Resource Allocation Graphs(1/4) • Deadlocks can be described using resource allocation graph • Vertices • Active processes {P1, P2, ...} • Resources {R1, R2, ...} • Edges • A directed edge from Pi to Rj • Process Pi requested an instance of resource Rj • A directed edge from Rj to Pi • Resource Rj has been allocated to process Pi • Process are circles, resources are rectangles 19