What are the methods for handling deadlocks?, Operating System

Assignment Help:

What are the methods for handling deadlocks?

The technique for handling the deadlocks are:

  • We are able to use protocol to prevent or avoid the deadlock, make sure that the system will never enter the deadlock state.
  • Recover and Detect if there is deadlock or not.

To make sure that deadlocks never occur, the system is able to use a deadlock prevention or deadlock prevention scheme. Deadlock prevention supplies a set of methods for ensuring that at least one of the necessary conditions cannot hold. Deadlock avoidance needs that the operating should be given advance information concerning with resources a process will request and use during its lifetime. If a system makes sure that a deadlock will never occur nor provides a mechanism for deadlock recovery and detection then we will reach a situation of deadlock but won't recognize what happened. To hold off the deadlock condition away from the system we must keep track of the resources each time, thus we will get the number of resources that are free and the resources that are being used and being requested.

 


Related Discussions:- What are the methods for handling deadlocks?

Explain the various file types, Explain the various file types A common...

Explain the various file types A common technique for executing file types is to contain the type as part of the file name. The name is split into two parts - a name and an ext

Linux, write a linux command to display lines from 25 - 45 of directory "/e...

write a linux command to display lines from 25 - 45 of directory "/edc/password" write a linux command to display directory in /edc

Explain process state with diagram, Question 1 Explain single Partition Al...

Question 1 Explain single Partition Allocation and Multiple Partition Question 2 What is PCB? What useful information is available in PCB? Question 3 Explain Preemptive and No

What are placement and replacement algorithms, Placement algorithms :calcu...

Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are

What are the requirements for a swapper to work, The swapper work s on t...

The swapper work s on the biggest scheduling priority. Initially it will look for any sleeping process, if not get then it will see for the ready-to-run process for swapping. Bu

Define buffering, Define buffering. A buffer is a memory area that keep...

Define buffering. A buffer is a memory area that keeps data whereas they are transferred among two devices or among a device and an application. Buffering is done for three rea

Briefly discuss on page replacement, Briefly discuss on page replacement? ...

Briefly discuss on page replacement? Page replacement approach is fixed as follows. If no frame is free, we search one that is not presently being used and free it. We can fre

Explain beladys anomaly, Explain Belady's Anomaly? Also called FIFO ano...

Explain Belady's Anomaly? Also called FIFO anomaly. Usually, on enhancing the number of frames allocated to a process virtual memory, the process implementation is faster, beca

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