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
Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.

What is the main function of the memory-management unit? The runtime mapping from virtual to physical addresses is done by a hardware device known as a memory management unit (

I need help,i want a brief and easy explanation to understand and write in exams and easy to understand topic of DMA block diagram which Is of I/O management and scheduling? can u

Deadlock Avoidance It's a method to evade deadlock by careful resource scheduling. This approach to the deadlock problem foresees deadlock before it actually occurs. This a

Q. Explain about Input - Output System Management? I/O System Management The module which keeps track of the status of devices is known as I/O traffic controller. Every

When do we write a page from physical memory back to the disk? In general, caches have two broad types of writing policies. One approach is a write-through cache. In this case,

Some CPUs provide for more than two modes of operation. What are two possible uses of these multiple modes?

Virtual addresses are made up of two parts: the ?rst part is the page number, and the second part is an offset inside that page. Suppose our pages are 4kb (4096 = 212 bytes) long,

What is multiprogramming? Multiprogramming: The management of many processes within a single processor system. Operating systems such like UNIX provide multiprogramming for sha

Q.  You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr