Assignment 4

Operating Systems Principles

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CPSC435 (W2008) Operating Systems Answer Key for Assignment 4 1. Construct a request-allocation graph for a system containing the following information. (a) resource R1 has 2 units (b) resource R2 has 1 unit (c) resource R3 has 1 unit (d) resource R4 has 3 units (e) process P1 has a pending request to R4 and been granted 1 unit of R1 (f) process P2 has a pending request to R3 and been granted 1 unit of R1 (g) process P3 has a pending request to R1, R2, and R3 each (h) process P4 has two pending requests to R4 and been granted 1 unit of R3 2. Solve Problems 2(a) and 2(b) in the textbook (p. 201). You should use the graph
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the 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 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 2 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 3...
View Full Document

Page1 / 3

Assignment 4 - reduction method (step by step) shown in...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online