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
Allocators can also be used to avoid problems with unsafe languages. C and C++ are pervasive, with huge amounts of existing code. They are also memory-unsafe languages, in that the

write a linux command to display lines from 25 - 45 of directory "/edc/password" write a linux command to display directory in /edc

What disadvantages are there to this two-level directory? Without other provisions, two users who require cooperating with each other are hampered in reaching every other's fi

Q. Consider a calculating environment where a process is given the privilege of accessing object only n times. Suggest a scheme for implementing this policy. Answer: Add an i

What problems arise if the directory structure is a general graph? Searching for a particular file may result in searching the similar directory many times. Deletion of the fil

KERNEL-LEVEL THREADS (KLT) In this level every thread management is done by kernel .No thread library except an API system calls to the kernel thread facility exists. The kern

The general idea of a producer-consumer architecture is related to building a pipeline of threads, similar to the web spider from Project 2. Each step of the processing will now be

Determine a policy that is not a valid page replacement policy?  RU policy (Recurrently used) is not a valid page replacement policy.

What is a client server system? Centralized systems proceed as server systems to satisfy request generated by client systems Server system is able to be broadly div

how to differentiate scheduling algorithms?