As discussed in the previous post, deadlock has following characteristics.
- Mutual Exclusion
- Hold and Wait
- No preemption
- Circular wait
We can prevent Deadlock by eliminating any of the above four conditions.
Eliminate Mutual Exclusion
It is not possible to dis-satisfy the mutual exclusion because some resources, such as the tape drive and printer, are inherently non-shareable.
Eliminate Hold and wait
- Allocate all required resources to the process before the start of its execution, this way hold and wait condition is eliminated but it will lead to low device utilization. for example, if a process requires printer at a later time and we have allocated printer before the start of its execution printer will remain blocked till it has completed its execution.
- The process will make a new request for resources after releasing the current set of resources. This solution may lead to starvation.
Eliminate No Preemption
Preempt resources from the process when resources required by other high priority processes.
Eliminate Circular Wait
Each resource will be assigned with a numerical number. A process can request the resources increasing/decreasing. order of numbering.
For Example, if P1 process is allocated R5 resources, now next time if P1 ask for R4, R3 lesser than R5 such request will not be granted, only request for resources more than R5 will be granted.
Deadlock avoidance can be done with Banker’s Algorithm.
Bankers’s Algorithm is resource allocation and deadlock avoidance algorithm which test all the request made by processes for resources, it checks for the safe state, if after granting request system remains in the safe state it allows the request and if there is no safe state it doesn’t allow the request made by the process.
Inputs to Banker’s Algorithm:
- Max need of resources by each process.
- Currently allocated resources by each process.
- Max free available resources in the system.
The request will only be granted under the below condition:
- If the request made by the process is less than equal to max need to that process.
- If the request made by the process is less than equal to the freely available resource in the system.
Total resources in system: A B C D 6 5 7 6
Available system resources are: A B C D 3 1 1 2
Processes (currently allocated resources): A B C D P1 1 2 2 1 P2 1 0 3 3 P3 1 2 1 0
Processes (maximum resources): A B C D P1 3 3 2 2 P2 1 2 3 4 P3 1 3 5 0
Need = maximum resources - currently allocated resources. Processes (need resources): A B C D P1 2 1 0 1 P2 0 2 0 1 P3 0 1 4 0
Note:Deadlock prevention is more strict that Deadlock Avoidance.
Following are Gate Previous Year Question
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Difference between Deadlock Prevention and Deadlock Avoidance
- Introduction to TimeStamp and Deadlock Prevention Schemes in DBMS
- Zombie Processes and their Prevention
- Deadlock Detection And Recovery
- Difference between Deadlock and Starvation in OS
- Deadlock, Starvation, and Livelock
- Conditions for Deadlock in Operating System
- Deadlock detection in Distributed systems
- Introduction of Deadlock in Operating System
- Recovery from Deadlock in Operating System
- Deadlock Ignorance in Operating System
- Deadlock Detection in Distributed Systems
- Operating Systems | Deadlock | Question 2
- Operating Systems | Deadlock | Question 1
- Deadlock Detection Algorithm in Operating System
- Hierarchical Deadlock Detection in Distributed System
- Program for Deadlock free condition in Operating System
- Chandy-Misra-Haas's Distributed Deadlock Detection Algorithm
Improved By : VaibhavRai3