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
What is real time system? A real time system has well explained, fixed time constraints. Processing must be done within the explained constraints, or the system will fail. It i

Representation in Prolog - Logic Programs: If we justimpose some additional constraints on first-order logic, so than we get to a representation language knowing as logic prog

Explain the meaning of BIND socket primitive The bind Primitiv: While created, a socket has neither a remote address nor a local address. A server utilizes the bind proce

What are Language Processor Development Tools (LPDTs)? LPDT that is Language processor development tools focuses upon generation of the analysis phase of language processors. T

Q. What is Synchronous message passing? In Synchronous message passing is executed on synchronous communication network.  In that case sender and receiver processes should be

what is computer

Define Bandwidth? When transferring blocks of data, it is of interest to know how much time is required to transfer an entire block, as blocks can be variable in size it is use

Q. Need of the assembly language ? Machine language code comprises the 0-1 combinations which computer decodes directly.  Though the machine language has the following problems

Define the full form of SSL SSL has become fundamental to the spread of Internet community, and commerce and trade over Internet. Over years, the spread of its use for an incr

Enumerate the data structures used during the first pass of the assembler. Indicate the fields of these data structures and their purpose/usage. Three main data structures used