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?

What is the main problem with the fcfs scheme, Question : a) Consider ...

Question : a) Consider table 1.0 below, assume the processes arrived in the order P 1 , P 2 , P 3 , P 4 at time shown and need the indicated burst time (both in milliseconds)

Designing issues in a network-scalability, Scalability Scalability is t...

Scalability Scalability is the ability of the system to adapt to increased service load. A scalable system will respond more gracefully to increased load than a non scalable on

Scheduler that select process from secondary storage device, A scheduler th...

A scheduler that selects processes from secondary storage device is known as                    Medium term scheduler is a scheduler that selects processes from secondary stor

What is a path name, What is a path name? A pathname is the path from t...

What is a path name? A pathname is the path from the root by all subdirectories to a specified file. In a two-level directory structure a user name and a file name explain a pa

Example of semaphore, For example, by initializing a semaphore to 0, thread...

For example, by initializing a semaphore to 0, threads can wait for an event to occur, and impose an ordering constraint, similar to a monitor using condition variables, but with m

Explain the general structure of a typical process, Explain the general str...

Explain the general structure of a typical process? There are basically four main sections through which each of the process has to pass through.The universal algorithm is:-

What is cold backup, Cold Backup: It is copying the three groups of files...

Cold Backup: It is copying the three groups of files when the object is shut down. This is a straight file copy, generally from the storage disk directly to tape. You must end th

Define program preemption, Define Program preemption The Forced de-allo...

Define Program preemption The Forced de-allocation of the CPU from a program which is executing on the CPU is known as Program preemption

BARBER SHOP PROBLEM, a) The barber shop has one barber, one barber chair, a...

a) The barber shop has one barber, one barber chair, and n chairs for waiting customers, to sit on. If there are no customers present, the barber sits down in the barber chair and

What are overlays, What are overlays? To enable a process to be larger ...

What are overlays? To enable a process to be larger than the amount of memory allocated to it, overlays are used. The idea of overlays is to keep in memory only those instructi

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