This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: reduction method (step by step) shown in class to determine those processes involved in a deadlock (if there is any) (a) P3 and P4 are blocked (b) P2 P1 P3 P2 P4 R4 R3 R2 R1 2 Step 1: reduce the graph by P1 Step 2: reduce the graph by P2 P1 P2 P3 P4 R1 R2 R3 R4 P1 P2 P3 P4 R1 R2 R3 R4 3 Final graph: So P3 and P4 are deadlocked. 3. Show the resulting request-allocation graph after the graph reduction method is applied to the graph shown in Fig. 6-5 (a) (p. 188) if resource R1 contains only 1 unit. P1 P2 P3 P4 R1 R2 R3 R4 P1 P2 P3 P4 P5 R1 R2 R3...
View Full Document
- Spring '08
- Operating Systems, SEPTA Regional Rail, Jaguar Racing, AirTrain Newark, r3 r1 r2, P1 P2 P2, P1 P3