Scribd
Upload
21 views

Dedlock Notes

Dedlock college notes

Uploaded by

Gupta Ajay
Copyright
© © All Rights Reserved
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
21 views

Dedlock Notes

Dedlock college notes

Uploaded by

Gupta Ajay
Copyright
© © All Rights Reserved
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
You are on page 1/ 2

Introduction of Deadlock in Operating System

Last Updated : 26 Aug, 2024

A deadlock is a situation where a set of processes is blocked because


each process is holding a resource and waiting for another resource
acquired by some other process. In this article, we will discuss
deadlock, its necessary conditions, etc. in detail.

What is Deadlock?
Deadlock is a situation in computing where two or more processes are
unable to proceed because each is waiting for the other to release
resources. Key concepts include mutual exclusion, resource holding,
circular wait, and no preemption.
Consider an example when two trains are coming toward each other
on the same track and there is only one track, none of the trains can
move once they are in front of each other. This is a practical example
of deadlock.

How Does Deadlock occur in the Operating System?


Before going into detail about how deadlock occurs in the Operating
System, let’s first discuss how the Operating System uses the
resources present. A process in an operating system uses resources in
the following way.
• Requests a resource
• Use the resource
• Releases the resource
A situation occurs in operating systems when there are two or more
processes that hold some resources and wait for resources held by
other(s). For 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.

Examples of Deadlock
There are several examples of deadlock. Someof them are mentioned
below.
1. The system has 2 tape drives. P0 and P1 each hold one tape drive
and each needs another one.
2. Semaphores A and B, initialized to 1, P0, and P1 are in deadlock as
follows:
• P0 executes wait(A) and preempts.
• P1 executes wait(B).
• Now P0 and P1 enter in deadlock.

You might also like