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

Explain the various page replacement strategies, Explain the various page r...

Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU

#title.paging, explain hierarchical,hashed and inverted paging

explain hierarchical,hashed and inverted paging

What is the design issues involved in segmentation?, SEGMENTATION HARDWARE ...

SEGMENTATION HARDWARE An execution to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means of segment table. Ev

Difference between symmetric and asymmetric multiprocessing, Discuss differ...

Discuss difference between symmetric and asymmetric multiprocessing  Symmetric multiprocessing (SMP), in which every processor runs an identical copy of the operating system an

What is meant by the phrase thread-safe, The term thread-safe in computer p...

The term thread-safe in computer programming describes that routine or portion of the program that may be called from multiple programming threads without uncalled for interactions

Define drawback of distributed systems, Define drawback of Distributed syst...

Define drawback of Distributed systems Reliability is a drawback of Distributed systems

Computer, what is an operating system?

what is an operating system?

What is a file path name, What is a file path name? A list of the subdi...

What is a file path name? A list of the subdirectories, directories, and files we must traverse to reach a file from the root directory.

Write Your Message!

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