# hw3 - (4) D requests 4 (5) A requests 1 (6) B requests 0...

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

HOME WORK 3 Question 1 Explain how a Multi-level feed back queue works. In what situation does a process move to a lower (worse) priority queue? In what situations would it be ok to move a process to a higher (better) priority queue? Question 2 How can you simulate a Fair Share scheduler using a lottery scheduler? How could we allow users to change the priority of their own processes? Question 3 For both of the following resource request sequences below: Draw the resource allocation graph for this scenario. ( You only need to draw ONE graph, not one for each step) Does a dead lock occur? If so after which request? If a deadlock does occur, would a diﬀerent order of requests remove the deadlock? (a) Processes: A,B,C,D Diﬀerent Resources: 0,1,2,3,4,5 1

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

View Full Document
2 HOME WORK 3 (1) A requests 0 (2) B requests 5 (3) C requests 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (4) D requests 4 (5) A requests 1 (6) B requests 0 (7) B requests 4 (8) C requests 5 (9) D requests 2 (10) D requests 5 (b) Processes: A,B,C,D Dierent Resources: 0,1,2,3,4,5 (1) B requests 2 (2) A requests 3 (3) C requests 1 (4) D requests 3 (5) B requests 5 (6) C requests 4 (7) A requests 0 (8) D requests 0 Question 4 Process 0 is requesting 2 more units of resource 1. Use the bankers algorithm from class to nd out if this request should be granted? If so, state the reason(s)? E = &lt; 5 , 2 , 6 , 1 , 1 &gt; A = &lt; 2 , 1 , 3 , 1 , &gt; C = 1 0 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 1 HOME WORK 3 3 R = 2 0 3 0 0 0 1 0 0 1 1 0 4 1 0 0 2 0 0 1 3 1 2 1 0...
View Full Document

## hw3 - (4) D requests 4 (5) A requests 1 (6) B requests 0...

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

View Full Document
Ask a homework question - tutors are online