Explain deadlock detection and recovery, Operating System

Assignment Help:

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.

 


Related Discussions:- Explain deadlock detection and recovery

Define an imperative statement, Determine an imperative statement Imper...

Determine an imperative statement Imperative statement points out an action to be carried out during execution of assembled program

Most-recently used algorithm, Evicting the most-recently used (MRU) page do...

Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory

Explain doscreatethread functions used in the os/2, Explain DosCreateThread...

Explain DosCreateThread Functions Used in the OS/2  DosCreateThread(&threadID,MyThreadFunction,arg,flags,stackSize) DosCreateThread creates a thread within the context of th

Develop the material requirements plan, The following information is availa...

The following information is available for three MPS (Master Product Scheduling) items: Product A                            An 80 unit order is to be started in Week 3.

Explain hierarchical paging method, Hierarchical paging method Most mo...

Hierarchical paging method Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy

Computer organisation, basic advantage of using interrupt initiated data tr...

basic advantage of using interrupt initiated data transfer over transfer under program control without an interrupt

Explain lru approximation page replacement, LRU approximation page replacem...

LRU approximation page replacement In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for

Page faults, Assume there are only 4 page frames in the physical memory, fo...

Assume there are only 4 page frames in the physical memory, for the following reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2, 8. a) What i

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd