Unit IV: Deadlock – Operating System

Deadlock is a situation which involves the interaction of more than one resources and processes with each other.

We can visualize the occurrence of deadlock as a situation where there are two people on a staircase. One is ascending the staircase while the other is descending. The staircase is so narrow that it can only fit one person at a time.

In this “Deadlock – Operating System” you will learn about the following topics:

System Model
System Resources
Preemptable, Non-Preemptable
Conditions for Resources Deadlock
Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait
Deadlock Modeling
Ostrich Algorithm
Methods of Handling Deadlocks
Deadlock Prevention
Elimination of “Mutual Exclusion” Condition
Elimination of “Hold and Wait” Condition
Elimination of “No-preemption” Condition
Elimination of “Circular Wait” Condition
Deadlock Avoidance
Banker’s Algorithm (Single Resource)
Banker’s Algorithm (Multiple Resources)
Deadlock Detection
Resource Allocation Graph
Recovery from Deadlock
Recovery Through Preemption
Recovery Through Rollback
Recovery Through Killing Processes
Starvation
Difference between Deadlock and Starvation

========== Point to Note ==========

If you like to contribute, you can mail us BCA Notes, BCA Question Collections, BCA Related Information, and Latest Technology Information at bcanotespu@gmail.com.

See your article appearing on BCA Notes (Pokhara University) main page with your designation and help other BCA Students to excel.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.