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

Necessary conditions for deadlock, Here are the conditions necessary for a ...

Here are the conditions necessary for a deadlock to occur; note that all of them are necessary, and none is suf?cient: 1. ?nite resources: the resources are held in a mutually-e

List post-installation procedures that need to be performed, Problem: (...

Problem: (a) Based on your experience in setting up Windows 2003 Server operating system, briefly describe the twelve different steps in which the installation is conducted du

What is starvation?, What is starvation? A main problem related to dead...

What is starvation? A main problem related to deadlock is starvation. Starvation is the circumstances where process waits indefinitely within the semaphore. Indefinite blocking

What circumstances is a token-passing network more effectual, Q. In what ci...

Q. In what circumstances is a token-passing network more effectual than an Ethernet network? Answer: A token ring is extremely effective under high sustained load as no colli

Locks - mutexes, Locks (also known as mutexes, short for mutual exclusion l...

Locks (also known as mutexes, short for mutual exclusion locks) provide mutual exclusion to shared data inside a critical session. They are implemented by means of two atomic routi

Define the os/2 threads code, Define the OS/2 threads code The sample p...

Define the OS/2 threads code The sample program in Listing is very similar to the NetWare example. OS/2 commands are substituted for the pseudocode commands controlling thread

What is the main advantage of multiprogramming, What is the main advantage ...

What is the main advantage of multiprogramming? Multiprogramming makes efficient use of the CPU by overlapping the demands for the CPU and its I/O devices from various users. I

Explain lru approximation page replacement in detail, LRU approximation pag...

LRU approximation page replacement In this we utilize the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for the imp

What are interrupts?, What are interrupts? Interrupts are in some way...

What are interrupts? Interrupts are in some ways the mainly "famous" system resources, ever since almost everyone who's used a computer has heard of them even if they don't k

What is paging? , What is paging? Paging is a memory management schem...

What is paging? Paging is a memory management scheme that authorizes the physical-address space of a process to be noncontiguous. Paging evades the considerable problem of fi

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