This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 414 Assignment 4 Solutions 5 points per answer for 2a-f, 10 points per answer for 1, 3, 4a-d and 5 (100 max). Due Wednesday March 8. Short-answer questions (just a sentence or two each,please). 1. In class we saw a deadlock avoidance algorithm that breaks circular waits by ordering resources. Assume a total ordering of resources and single instance of each resource type. Assume that processes acquire resources in decreasing order. Does releasing resources before acquiring new resources cause a deadlock? (Provide a short explanation for your answer). Solution No. The resources are still requested in the decreasing order (we are assuming that the process does not re-request a higher numbered resource after it has released it and acquired a lower numbered resource). This breaks the Circular Wait condition and avoids a deadlock. 2. In a real computer system, niether the resources available nor the demands of processes for resources are consistent over long periods (months). Resources break or are replaced, new processes come and go, new resources are bought and added to the system. If deadlock is controlled by the bankers algorithm, which of the following changes can be made safely (without introducing the possibility of deadlock), and under what circumstances?and under what circumstances?...
View Full Document
This homework help was uploaded on 09/26/2007 for the course COM S 414 taught by Professor Birman during the Spring '06 term at Cornell University (Engineering School).
- Spring '06