Overview of Deadlock unit 3 part 1

OVERVIEW OF DEADLOCK
(Part –I )

CONTENTS
What is Deadlock?
 Dead lock
Characterization
 Approaches of Dead Lock
•Dead ock
Prevention
•Deadlock Detection
•Deadlock
Avoidance
10/6/2021
2 Dr.M.Karthika AP/IT/MTNC

What is Deadlock?
 Deadlock is a situation that occurs in OS.
 Deadlocks are a set of blocked processes each
holding a resource and waiting to acquire a resource
held by another process.
 Deadlock is a common problem in multi-processing
where several processes share a specific type of
mutually exclusive resource known as a soft lock or
software.
10/6/2021

Every process needs some resources to complete
its execution. However, the resource is granted in a
sequential order.
 The process requests for some resource.
 OS grant the resource if it is available otherwise let the process
waits.
 The process uses it and release on the completion.
10/6/2021

Example
In the below diagram, Process 1 is holding Resource 1 and waiting for
resource 2 which is acquired by process 2, and process 2 is waiting
for resource 1.
10/6/2021

Deadlock Characterization
( four Coffman conditions )
1. Mutual Exclusion
A resource can only be shared in mutually exclusive
manner. It implies, if two process cannot use the same
resource at the same time.
2. Hold and Wait
A process waits for some resources while holding
another resource at the same time.
10/6/2021

3. No preemption
The process which once scheduled will be executed till
the completion. No other process can be scheduled by
the scheduler meanwhile.
4. Circular Wait
All the processes must be waiting for the resources in a
cyclic manner so that the last process is waiting for the
resource which is being held by the first process.
10/6/2021

There are three approaches to deal with deadlocks.
1. Deadlock Prevention
2. Deadlock avoidance
3. Deadlock detection
10/6/2021

Deadlock Prevention
 The strategy of deadlock prevention is to design the
system in such a way that the possibility of deadlock
is excluded.
 Indirect method prevent the occurrence of one of three
necessary condition of deadlock i.e., mutual exclusion,
no pre-emption and hold and wait.
 Direct method prevent the occurrence of circular wait.
10/6/2021

Prevention techniques
 Mutual exclusion
 Hold and Wait
 No pre-emption
10/6/2021

Deadlock Detection
 Deadlock can be detected by the resource scheduler
as it keeps track of all the resources that are
allocated to different processes.
 After a deadlock is detected, it can be handed using
the given methods
All the processes that are involved in the deadlock are
terminated. This approach is not that useful as all the
progress made by the processes is destroyed.
Resources can be preempted from some processes
and given to others until the deadlock situation is
resolved. 10/6/2021

Deadlock Avoidance
 It is better to avoid a deadlock rather than take
measures after the deadlock has occurred.
 The wait for graph can be used for deadlock
avoidance. This is however only useful for smaller
databases as it can get quite complex in larger
databases.
10/6/2021

 A decision is made dynamically whether the current
resource allocation request will, if granted, potentially
lead to deadlock.
 It requires the knowledge of future process requests.
 Two techniques to avoid deadlock :
 Process initiation denial
 Resource allocation denial
10/6/2021

Advantages :
 Not necessary to pre-empt and rollback processes
 Less restrictive than deadlock prevention
Disadvantages :
 Future resource requirements must be known in
advance
 Processes can be blocked for long periods
 Exists fixed number of resources for allocation
10/6/2021

Thank You
10/6/2021

Overview of Deadlock unit 3 part 1

More Related Content

What's hot (20)

Similar to Overview of Deadlock unit 3 part 1 (20)

More from Dr.M.Karthika parthasarathy (20)

Recently uploaded (20)

Overview of Deadlock unit 3 part 1