Deadlock in OS

Presentation
What is Deadlock
Deadlock is a state in a computer system where two or
more processes are unable to proceed because each is
waiting for the other to release a resource, such as
memory or a file, or to perform an action.
Examples
Real-life
One real-life example of deadlock is a traffic
gridlock. Imagine an intersection where four
roads meet, and there are traffic lights
controlling the flow of vehicles. If each road
has equal traffic volume and the traffic
lights are not coordinated properly, a
deadlock can occur.
Technical
A classic technical example of
deadlock involves two processes
competing for two resources, each
holding one resource and waiting
for the other
 Condition

Hold and Wait Non Preemption

Mutual Exclusion Circular Wait

 Resource
Allocation Graph
 Deadlock Preventions
Deadlock prevention involves modifying the system to ensure that at least one of the
necessary conditions for deadlock cannot hold. There are several strategies to achieve this:

Mutual Exclusion: Allow resources to be shareable instead of exclusive. If resources can be

used by multiple processes simultaneously, the mutual exclusion condition is eliminated.

Hold and Wait: Require processes to request and acquire all the resources they need at the
start, rather than acquiring them incrementally. This ensures that a process only holds
resources while it is actively executing, reducing the likelihood of deadlock.

No Preemption: Allow resources to be preempted if necessary. If a process holding resources

is waiting for additional resources that are held by other processes, those resources can be
preempted and allocated to the waiting process, breaking the potential deadlock.

Circular Wait: Impose a total ordering of resource types and require that each process
requests resources in an increasing order of enumeration. This way, circular waits are
prevented because processes can only request resources that are of a lower priority than the
ones they currently hold.
Strategies for
handling deadlock
prevention
Modify the system to
prevent at least one of the
necessary conditions for
deadlock (mutual
exclusion, hold and wait,
no preemption, circular
wait) from occurring.
Avoidance Resource
Preemption
Use algorithms that Temporarily take resources away
dynamically analyze the from some processes and give them
to others to break the circular wait
state of the system to condition.
ensure that deadlock will Requires careful implementation to
not occur. avoid race conditions and ensure
fairness.
Thank You !