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

File management, five major activities on file management in operating syst...

five major activities on file management in operating system.? Explain it.?

Processes and programs, Processes and Programs Process is a dynamic...

Processes and Programs Process is a dynamic entity which is a program in execution. A process is a sequence of information executions. Process exists in a limited span of t

Operating system structure, Problem: (a) Modern operating systems are i...

Problem: (a) Modern operating systems are interrupt driven. If there are no processes to execute, no I/O devices to service, and no users to whom to respond, an operating syste

How can deadlocks be represented?, How can deadlocks be represented? D...

How can deadlocks be represented? Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the foll

Explain types of file allocation-contiguous allocation, Contiguous allocati...

Contiguous allocation: Every file will be allocated contiguous space in the memory. Allow the block size be 1K If a 50K files desires to be allocated space after t

Explain process scheduling in time sharing, Explain process scheduling in t...

Explain process scheduling in time sharing The relevant features of time sharing are: 1.      Process priorities do not depend on the nature of the processes 2.      Proc

Replacement algorithm for tlb, Consider the following C program where M, N,...

Consider the following C program where M, N, K are predefined constants. Assume int is 4 bytes. Suppose this program is run on a machine with 4KB page size and 32 TLB entries. Init

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

Define action that implementing meaning of instruction, Determine how Actio...

Determine how Action implementing instruction’s meaning are a actually carried out   Action implementing meaning of instruction are a actually carried out Instruction executio

Cpu scheduling alogarithm program in javascript, a program that can do cpu ...

a program that can do cpu scheduling algorithm priority using javascript or php to display gaant chart and calculate waiting and average waiting time

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