Deadlock Detection and Recovery

It's a method of permitting the system to enter a deadlock state, detect it and then recover.

Deadlock detection :

• Is the process of in fact determining that a deadlock exists and identifying the processes and resources involved in the deadlock.
• The fundamental idea is to check allocation against resource availability for all possible allocation sequences to determine if the system is in deadlocked state. 
• As well a Wait-For-Graph (WFG) may be used if there is only a single instance of each resource. In the WFG the nodes denotes processes and the edges denotes the blockages or dependencies.  Therefore if process A is waiting for a resource deem by process B there is an edge in the WFG from the node for process A to the node for process B.A cycle in the graph point to a deadlock.

Deadlock recovery:

Formerly a deadlock is detected, there wants to be a way to recover several alternatives exists:

• Temporarily protect resources from deadlocked processes.
• Back off a process to some check point permitting preemption of a needed resource and restarting the process at the checkpoint later.
• Successively termination processes until the system is deadlock free.

 

Posted Date: 6/21/2013 7:52:25 AM | Location : United States

Ask an Expert

Related Discussions:- Explain deadlock detection and recovery, Assignment Help, Ask Question on Explain deadlock detection and recovery, Get Answer, Expert's Help, Explain deadlock detection and recovery Discussions

Write discussion on Explain deadlock detection and recovery
Your posts are moderated

Write your message here..

Related Questions

Determine a processing that is not a part of synthesis phase, Determine a p... Determine a processing that is not a part of Synthesis phase  Perform LC processing is not a part of Synthesis phase

Explain concept of synchronization, Synchronization In communication am... Synchronization In communication among processes messages passed may be blocking or nonblocking - also called as synchronous and asynchronous. Blocking send : The sending pr

Define pure and impure interpreters, Pure and impure interpreters      ... Pure and impure interpreters      In a pure interpreter, the source program is maintained in the source form throughout its interpretation. This arrangement acquires substantia

Virtual memory, In modern operating systems, applications do not directly a... In modern operating systems, applications do not directly access the physical memory. Instead, they use so-called virtual memory, where each virtual address is translated to a phys

Virtual memory and paging, A- Consider a computer system that provides a vi... A- Consider a computer system that provides a virtual memory space that consists of 8  pages. The physical memory contains 4 pages where the page size is 4Kbytes. Assume that at sp

Explain first fit algorithm, FIRST FIT ALGORITHM Scanning a list along... FIRST FIT ALGORITHM Scanning a list along with if a free hole is available with necessary space for the process to allocate it allocates the process in that space. The first s

Explain external fragmentation?, Explain external fragmentation? Extern... Explain external fragmentation? External fragmentation is the process where the free space and the space still available for use, in a piece of storage become separated into ma

Android, Which android version is available till now Which android version is available till now

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

Directory structure, Write about directory structure? Write about directory structure?