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
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

output devices used in virtual rality

What are assembler directives? Ans: These are the instructions that direct the program to be executed. They have no binary corresponding so they are called pseudo-opcodes. The

Not at this time. With GIMP based on GEGL, so that all changes are non-destructive, it will be much easier to execute this feature by just remembering all nodes in given range and

Q. Example of Input a Single Digit? Input a Single Digit for example (0,1, 2, 3, 4, 5, 6, 7, 8, 9)  CODE SEGMENT   ... ; Read a single digit in BL register with ech

The Throughput graph represents the amount of data in bytes that the Vusers received from the server in a second. When we evaluate this with the transaction response time, we will

The 68HC11 series is based on the Motorola 6800/1 programming instruction set and hence is a fairly simple 8 bit microprocessor. The internal structure of the 6800/1 is shown below

The concept of clustering is definite as the use of multiple computers, typically PCs or multiple storage devices, UNIX workstations, and their interconnections, to form what appea

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

As an XML expert you are needed to model a system for an online furniture shop. After an interview with the shop manager you have the certain information: The detail of th