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

Explain the fork-join, Explain the Fork-join This is primitives in a hi...

Explain the Fork-join This is primitives in a higher level programming language for implementing interacting processes. The syntax is like this: fork ; join ; where

10 marks, Differentiate between sequential access and direct access method?...

Differentiate between sequential access and direct access method?

Obelia, what do obelia eat and how do they feed

what do obelia eat and how do they feed

Define some language processors, Define Name of some language processors?  ...

Define Name of some language processors?   Name of some language processors are as follow: Assembler, Compiler and Interpreter

Explain chaining to handle collision, Explain Chaining to Handle Collision ...

Explain Chaining to Handle Collision Chaining:  One easy scheme is to chain all collisions in lists attached to the suitable slot. This permits an unlimited number of collision

Choice of operating systems to boot from, Q. How could a system be designed...

Q. How could a system be designed to allow a choice of operating systems to boot from? What would the bootstrap program need to do? Answer: Delieve a system that would like to

Define what is dispatcher, Define what is Dispatcher In the Worker Mode...

Define what is Dispatcher In the Worker Model, it is the task of the Dispatcher to spawn a thread for every client-to-server connection. The Dispatcher acts as the go-between o

Explain the tlsgetvalue (tlsindex) function, Explain the TlsGetValue (TLSin...

Explain the TlsGetValue (TLSindex) Function Executing this function will return the thread local storage data associated with this thread. The pointer returned will be the one

Explain fixed partitioning techniques, FIXED PARTITIONING In a fixed p...

FIXED PARTITIONING In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes -Using fixed partit

What is co-operative process, What is co-operative process? A process i...

What is co-operative process? A process is co-operating if it can influence or be affected by the other processes implementing in the system. Any process that share data with o

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