necessary conditions for a deadlock , Operating System

Q) a. Given that the first three necessary conditions for a deadlock are in place, comment on the feasibility of the following strategy. All processes are given  unique priorities. When more than one process is waiting for a resource and  the resource becomes available, allocate the resource to the waiting process with the highest priority.

b. Would the support of user-level threads change your answer for part a? Explain.

Posted Date: 3/15/2013 6:24:29 AM | Location : United States







Related Discussions:- necessary conditions for a deadlock , Assignment Help, Ask Question on necessary conditions for a deadlock , Get Answer, Expert's Help, necessary conditions for a deadlock Discussions

Write discussion on necessary conditions for a deadlock
Your posts are moderated
Related Questions
Relative file organization A relative file is an array of fixed-length slots and the records can be inserted in the first free slot found from the beginning of the file and

What are over lays? If a large process enters which is huge than the available memory we are able to use overlays. In this we can divide process into pieces .which is recognize

Direct memory access Many computers avoid burdening the main CPU with programmed I/O by offloading sine if this work to a special-purpose processor known as a direct memory add

Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph.  b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

Debugging a multi threaded program The following list points out few of the more frequent oversights and errors that can cause bugs in multithreaded programs. 1.    Ephemeral

What are the methods for handling deadlocks ? The technique for handling the deadlocks are: We are able to use protocol to prevent or avoid the deadlock, make sure tha

what is it all about? why do we need? what are the types of backup? how is it done in unix?

What does it mean for something to be thread-safe? By saying that X is thread-safe, we mean that if multiple threads use X at the same time, we don't have to worry about concurrenc

Q. Capability lists are typically kept within the address space of the user. How does the system make sure that the user cannot modify the contents of the list? Answer: An ap