Operating systems notes
Deadlocks I: Prevention & Avoidance
When every thread is politely waiting for another, and the whole system stops forever. Every section is a drawn page beside a clear written explanation, about 18 minutes in all.
- Chapter 18 of 37
- About 18 minutes
- 8 sections
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
In this chapter
- What a deadlock actually is
- The four Coffman conditions
- Resource-allocation graphs: drawing the deadlock
- Four ways to deal with deadlock
- Prevention: break one of the four conditions
- The ostrich algorithm: just ignore it
- Avoidance & the idea of a safe state
- The Banker’s algorithm
Next chapters
Read the whole chapter
Sign in and the chapter opens with every drawn page, and all 38 operating systems chapters beside it.
DSA comes with the all labs plan and every ChaiCode batch.