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.

Deadlock – Operating System

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

  1. System Model
  2. System Resources
  3. Preemptable, Non-Preemptable
  4. Conditions for Resources Deadlock
  5. Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait
  6. Deadlock Modeling
  7. Ostrich Algorithm
  8. Methods of Handling Deadlocks
  9. Deadlock Prevention
  10. Elimination of “Mutual Exclusion” Condition
  11. Elimination of “Hold and Wait” Condition
  12. Elimination of “No-preemption” Condition
  13. Elimination of “Circular Wait” Condition
  14. Deadlock Avoidance
  15. Banker’s Algorithm (Single Resource)
  16. Banker’s Algorithm (Multiple Resources)
  17. Deadlock Detection
  18. Resource Allocation Graph
  19. Recovery from Deadlock
  20. Recovery Through Preemption
  21. Recovery Through Rollback
  22. Recovery Through Killing Processes
  23. Starvation
  24. 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 [email protected].

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.

BCA 4th Semester Operating System Notes Pdf: