Have you ever faced any of these problems?
If yes, your system was in a DEADLOCK state.
Deadlock in operating system is a situation which occurs when a process or thread enters a waiting state because a resource requested is being held by another waiting process, which in turn is waiting for another resource held by another waiting process. In a deadlock state a process is unable to change its state(waiting) indefinitely because the resources requested by it are being used by another waiting process.
Example of Deadlock:
Let there be 2 processes P1 and P2 and 2 resources R1 and R2. Both P1 and P2 require Both R1 and R2 to complete their tasks. Suppose P1 acquires R1 first.
In the mean time P2 acquires R2. Now when P1 requests for R2 it will have to wait (because R2 is being held by P2). Similarly, when P2 requests for R1 it will also have to wait. Neither P1 nor P2 will not be able to change their waiting state since both are holding the resource required by the other process and none will release its resource until their allocated task is over. Hence the system will be in deadlock.
From the above discussion we can identify 4 conditions that must be true together for the deadlock to occur.
Mutual Exclusion means that the resource can be used by only one process at any given point of time i.e. the resource is non sharable. e.g. Printer. Two processes can not print a document at the same time from a printer. Hence printer is a non sharable resource.
Hold and Wait means that the process must be holding at least one resource and requesting for at least one resource. e.g. Process P1 is holding resource R1 and waiting for the resource R2.
No Preemption means that non of the processes involved in the deadlock is ready to release (preempt) the resource it is currently holding.
Circular wait means A set {P0, P1,..Pn} of waiting processes must exist such that P0 is waiting for a resource held by P1, P1 waiting for resource held by
P2, …Pn-1 is waiting for resource held by Pn and Pn waiting for a resource held by P0.
Resource allocation graphs are used to describe a deadlock. Resource allocation graph consists of
Vertices (V) – that represent Processes (in circle) and Resources (in rectangles)
Edges (E) – Request edge (from process towards resource) and Assignment edge (from resource towards process)
Instances of a resource are represented by a dot(.)
Example:
Q1. What is the difference between deadlock and starvation?
Q2. Is there a deadlock in the scenario below?
Note: Click within the slide area for animations. Clicking on the “next” slide button will not display any animation
Previous Next Process Synchronization Deadlock Prevention
yes
cycle – p1-r1-p3-r2-p1
ANS -Practice question -No Deadlock condition is there .
Reason:-Because Process P2 and Process P4 are not satisfying hold and wait condition necessary for deadlock condition.
Correct
P1 < R1 < P3 < R2
Because P1 requests for R1, but R1 is allocated to P2, P3.
Cycle wait
yes there is a deadlock because the instance p3 needs is hold by p1 and vice versa which invokes the deadlock hold and wait and circular wait
No because if p4 release R2. then resource can allocate to P3.
Correct
Yes there is a deadlock, because the cycle exists.
NO becouse Process P4 may release its instance of resource type R2. That
resource can then be allocated to P3,
Correct
Que 1-In deadlock each process holding a resource and trying to access the other resource and in starvation , when the process is in the ready state and have all resources that it needs but the short term scheduler did not choose that process because of priority and that process waiting for the execution for a long time this leads to starvation
Starvation : Long waiting
Deadlock : Infinite waiting.
Absolutely correct Rohith