3.6Operating Systems
Deadlock Visualizer
Explore resource allocation graphs, detect deadlocks via cycle detection, and resolve them. Compare safe and unsafe states.
Scenarios:
Resource Allocation Graph
Process Resource Holds Waits for
Processes
P1
Holds: R1
Waiting: R2
P2
Holds: R2
Waiting: R1
Resources
R1
U
R2
U
Four conditions for deadlock:
1. Mutual Exclusion: Resources can't be shared
2. Hold & Wait: Processes hold resources while waiting
3. No Preemption: Can't forcibly take resources
4. Circular Wait: Cycle in wait-for graph