What are the four necessary condition of deadlock prevention, Computer Engineering

What are the four necessary conditions of deadlock prevention?

Four essential conditions for deadlock prevention are:

1.  Removing  the  mutual  exclusion  condition  implies  that  no  process  may  have exclusive access to a resource. It proves impossible for resources which cannot be spooled, and even along with spooled resources deadlock could still happen. Algorithms which avoid mutual exclusion are termed as non-blocking synchronization algorithms.

2. The "hold and wait" conditions may be eliminated by requiring processes to request all the resources they will require before starting up. The other way is to need processes to release all their resources before requesting all the resources they will require.

3. A "no preemption" or lockout condition may also be impossible or difficult to ignore as a process has to be capable to have a resource for a specific amount of time, or the processing outcome may be inconsistent or thrashing may happen. Though, inability to enforce preemption may interfere along with a priority algorithm. Algorithms which allow preemption contain lock-free and optimistic concurrency control and wait-free algorithms.

4. The circular wait condition: Algorithms which avoid circular waits contain "disable interrupts  throughout  critical  sections"  and  "use  a  hierarchy  to  find out  a  partial ordering of resources" and Dijkstra's solution.

Posted Date: 5/6/2013 8:49:43 AM | Location : United States







Related Discussions:- What are the four necessary condition of deadlock prevention, Assignment Help, Ask Question on What are the four necessary condition of deadlock prevention, Get Answer, Expert's Help, What are the four necessary condition of deadlock prevention Discussions

Write discussion on What are the four necessary condition of deadlock prevention
Your posts are moderated
Related Questions
Multiple Instruction and Single Data stream (MISD): In this type of organization multiple processing elements are ordered under the control of multiple control units. Every contro

Make a page translation table the meets the requirements of the virtual memory system given below.  Suppose page (and frame) sizes of 20 with pages 0 by 3 in logical memory and fra

how to breadboARD THE 4 BIT COMPARATOR

What is preemptive and nonpreemptive scheduling? Under nonpreemptive scheduling once the CPU has been allocated to a process, the process keeps the CPU unless it releases the C

What is a binary tree? A binary tree 'T' is described as A finite set of elements, known as nodes, such that: either (i) or (ii) happens: (i) T is empty (known as the 'nu

Use 4 D-bascules connected in serial all synchronized with the similar CLK. Then connect all 4 outputs, & 2nd output must reverse, of the D-bascule to an AND logic. The output of t

Explain essential loop in Process Scheduling . The complex part of scheduling is to balance policy enforcement along with resource optimization so as to pick the best job to run

Explained RAID? Ans: High performance devices tend to be costly. So we can gain very high performance at a reasonable cost using a number of low-cost devices operating in paral

Question: a Describe the following terms with reference to video editing: 1. Video frame rate 2. Pixel aspect ratio 3. Frame size 4. Temporal compression 5. Spatial comp

Q. What is the Future of Hyper threading? Current Pentium 4 based MPUs employ Hyper-threading however next-generation cores, Conroe, Merom and Woodcrest will not. As some have