Deadlock
Process A wants what process B has
Process B wants what process A has
Neither can make progress without acquiring the other’s resource
Neither will relinquish its own resource
No progress possible!
We saw this with the dining philosophers problem
Previous slide
Next slide
Back to first slide
View graphic version