Ex3-v2 - CECS 526 Exercise Problems on Deadlocks I Process...

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

View Full Document Right Arrow Icon
CECS 526 Exercise Problems on Deadlocks I. Process Deadlock ( Problems 1-9 are selected from Chapter 3 of Advanced Concepts in Operating Systems by Singhal and Shivaratri. ) 1. Give an example of a general resource graph that cannot be completely reduced, but which represents a system state that is free from deadlock. 2. Construct a general resource graph for the following scenario and determine if the graph is completely reducible: R 1 , R 2 , and R 3 are reusable resources with a total of two, two, and three units, respectively. Process P 1 is allocated one unit each of R 2 and R 3 and is requesting one unit of R 1 . Process P 2 is allocated one unit of R 1 and is requesting two units of R 3 . Process P 3 is allocated one unit each of R 1 and R 2 , and is requesting one unit of R 3 . 3. Compare and contrast the banker’s algorithm for deadlock avoidance and the graph reduction method for deadlock detection. 4. Show that the ordered request policy of Havender prevents deadlocks. 5. Consider a computer system which has four identical units of a resource R . There are three processes each with a maximum claim of two units of resource R . Processes can request these resources in any way, that is, two in one shot or one by one. The system always satisfies a request if enough resources are available. If the processes don’t request any other kind of resource, show that the system never deadlocks. 6. Assume a system has P processes and R identical units of a reusable resource. If each process can claim at most two units of the resource, show that the system will be deadlock free iff P R – 1. 7.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/11/2010 for the course CECS 526 taught by Professor Nguyen,t during the Spring '08 term at CSU Long Beach.

Page1 / 2

Ex3-v2 - CECS 526 Exercise Problems on Deadlocks I Process...

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

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