Write a note on deadlocks, Operating System

Assignment Help:

Write a note on deadlocks.

The proper definition of deadlock

A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the set can cause.

There are four essential conditions for deadlock to occur. They are as follows:

  1. Mutual Exclusion: Resources are not sharable.
  2. Non-preemption: formerly a resource is given to a process it can't be revoked until the process voluntarily gives it up.
  3. Hold and Wait: It is probable for a process that is holding resources to request more.
  4. Circular wait: It is probable for there to be a cyclic pattern of requests.

The techniques used by OS for handling deadlock are:

  1. Deadlock detection and recovery: Permit the system to enter a deadlock state, detect it and then recover.
  1. Deadlock prevention: Use a protocol to make sure that the system will never enter a dead lock state.          

      3.   Deadlock avoidance: Evade deadlock by careful resource scheduling.

 


Related Discussions:- Write a note on deadlocks

Memory hierarchy, Difference between cache and associate memory

Difference between cache and associate memory

Case studies, Did Abhinav agree to the initial timeline requested by Rebecc...

Did Abhinav agree to the initial timeline requested by Rebecca

Process abstraction in operating systems, Many early operating systems rega...

Many early operating systems regarded processes as different timesharing users. The process abstraction is a popular way to organize concurrent programs, but it is not the only cho

Write a short note about schedulers, Write a short note about schedulers. ...

Write a short note about schedulers. Processes migrate between the various scheduling queues throughout its life time. The operating system should select for scheduling purpose

Explain segmentation hardware?, Explain segmentation hardware? We defin...

Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means

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

Define the tlsfree(tlsindex) function, Define the TlsFree(TLSIndex) Functio...

Define the TlsFree(TLSIndex) Function This function should be called to free a TLSindex allocated by TlsAlloc. It would be executed when there are no more threads in a process

Memory management, diffenciet between least recently used and not recently ...

diffenciet between least recently used and not recently used

Cpu scheduling algorithm, Q. A CPU scheduling algorithm determined an orde...

Q. A CPU scheduling algorithm determined an order for the execution of its scheduled processes. Convinced n processes to be scheduled on one processor how numerous possible differ

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