Chapter 18. Resource allocation and deadlock

18.1 Requirements for dynamic allocation

18.2 Deadlock

18.3 Livelock and starvation

18.4 Conditions for deadlock to exist

18.5 The dining philosophers problem

18.6 Object allocation graphs

18.7 Data structures and algorithms for deadlock detection

18.8 Deadlock avoidance

18.9 Information on releasing objects: Multiphase processes

18.10 Distributed deadlocks

18.11 Summary

Get Operating Systems: Concurrent and Distributed Software Design now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.