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
How do subroutines help in program writing? Some of the significant characteristics of Subroutine that help in program writing are: A subroutine is named, each have a

Explain adaptive routing. Adaptive routing defines the ability of a system, by which routes are characterised through their destination, to change the path that the route takes

What are the various Design constraints used while performing Synthesis for a design? 1. Make the clocks (frequency, duty-cycle). 2. Explain the transition-time requirements

Ring This is a easy linear array where the end nodes are connected.  It is equivalent to a engage with wrap around connections. The data transmit in a ring is normally one dire

The program division.c is available for download as part of this assignment. It is a binary division program which works for signed integers. It contains a function, div32, which d

Give the details of excess 3 codes and gray code using four binary digits. Ans: Table of excess 3 codes and gray code using four binary digits Binary

What are condition codes? In many processors, the condition code flags are kept in the processor status register. They are either set are cleared by lots of instructions, so th

Follow these steps: 1. Produce XML from the DOM document tree. 2. Serialize the generated DOM document to a StringWriter. 3. Call toString on the StringWriter and pass it into

Determine the quivalence Partitioning? The division of domain data into dissimilar equivalence data classes is performed using Equivalence Partitioning. It is executed for redu

A system utility that comes with Windows that permits the use to change a variety of dissimilar Windows and system settings.