Deadlock handling in os

                                Deadlock handling

Deadlock handling method is used to solve the problem of deadlock.
There are four method used in deadlock handling.


1.  Prevantion     

  • Prevantion  means design such a system which violet at least one of four neccesory conditions of deadlock.
  • This ensure that the system remains free from deadlock.

2.  Avoidence 

  • This strategy involves maintaining a set of data using which a decision is made whether to entertain the new request or not.
  • If entertaining the new request causes the system to move in an unsafe state, then it is discarded.
  • This strategy requires that every process declares its maximum requirement of each resource type in the beginning.
  • The main challenge with this approach is predicting the requirement of the processes before execution.
  • Banker’s Algorithm is an example of a deadlock avoidance strategy.

   3. Deadlock detection and recovery

  • This strategy involves waiting until a deadlock occurs.
  • After deadlock occurs, the system state is recovered.
  • The main challenge with this approach is detecting the deadlock.

  4. Deadlock ignorence 

  • This strategy involves ignoring the concept of deadlock and assuming as if it does not exist
  • This strategy helps to avoid the extra overhead of handling deadlock.

  • Windows and Linux use this strategy and it is the most widely used method.
     It is also called as Ostrich approach.

  • To gain better understanding about Deadlock Handling Strategies, follow our website and join my FB page for more realted topic.

     Thank you viewers
This is published by soumy sinha...

Comments

Popular posts from this blog

Introduction of Digital computer

INTRODUCTION OF DBMS

Introduction to cache memory