Scribd
Upload
195 views16 pages

Deadlocks in Operating System

The document discusses deadlocks in operating systems. It defines a deadlock as a set of blocked processes that each hold a resource and wait for a resource held by another process in the set. Four conditions must be met for deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait. The document outlines methods to handle deadlocks, including prevention, avoidance, detection, and recovery. Resource allocation graphs are used to model deadlocks and identify cycles indicating a deadlock.

Uploaded by

Sara Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
195 views16 pages

Deadlocks in Operating System

The document discusses deadlocks in operating systems. It defines a deadlock as a set of blocked processes that each hold a resource and wait for a resource held by another process in the set. Four conditions must be met for deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait. The document outlines methods to handle deadlocks, including prevention, avoidance, detection, and recovery. Resource allocation graphs are used to model deadlocks and identify cycles indicating a deadlock.

Uploaded by

Sara Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

DEADLOCKS IN

OPERATING SYSTEM
1. The Deadlock Problem
2. Deadlock Characterization
3. Deadlock Modeling
4. Resource Allocation Graph
5. Methods for Handling Deadlocks
 Deadlock Prevention
 Deadlock Avoidance
 Deadlock Detection
 Recovery from Deadlock
WHAT ARE DEADLOCKS???

A set of blocked processes each


holding a resource and waiting to
acquire a resource held by another
process in the set.

o Example
 Process-1 requests the printer, gets it
 Process-2 requests the tape unit, gets it Process-1 and
 Process-1 requests the tape unit, waits Process-2 are
 Process-2 requests the printer, waits deadlocked!
FOUR CONDITIONS FOR DEADLOCKS???

1. Mutual Exclusion Condition

2. Hold & Wait Condition

3. No Preemption Condition

4. Circular Wait Condition


DEADLOCK MODELING???

Modeled with directed graphs


HOW DEADLOCKS OCCUR?
HOW DEADLOCKS CAN BE AVOIDED???
RESOURCE ALLOCATION GRAPHS???

 CIRCLES
 represents processes

 SQUARE
 represents classes of identical resources

 SMALL SQUARES DRAWN INSIDE LARGE SQUARES


 Indicate separate identical resources of each class
 If the resource allocation graph contains no cycles then there is
no deadlock in the system at that instance.

 If there is a cycle

o If there is only one instance per resource type than there is a deadlock
o If there is more than once instance for some resource type than there may
or may not be a deadlock
EXAMPLE OF A RESOURCE ALLOCATION GRAPH
HOW TO HANDLE DEADLOCKS???

• Four major areas of interest in deadlock research

- Deadlock Prevention
- Deadlock Avoidance
- Deadlock Detection
- Deadlock Recovery
DEADLOCK PREVENTION???

• Prevention eliminates one of four conditions

1. Elimination Of Mutual Exclusion

2. Elimination Of Hold & Wait Condition

3. Elimination Of No Preemption Condition

4. Elimination Of Circular Wait Condition


DEADLOCK AVOIDANCE???

• Maximum requirements of
each resource must be stated
in advance by each process.

• Two Approaches

• Two Algorithms
o Resource Allocation Algorithms
o The Banker’s Algorithm
DEADLOCK DETECTION???

• Determines if deadlock has occurred


• Identifies those processes & resources
involved in the deadlock
• Algorithms can incur significant
runtime overhead
RECOVERY FROM DEADLOCKS???

• Process Termination
o Abort all deadlocked processes.
o Abort one process at a time until
the deadlock cycle is eliminated.

• Resource Preemption
o Selecting a victim
o Rollback
o Starvation

You might also like