Detection Algorithm
"Wait-for" graph:
One node per T
Directed edge Ti?Tj if Ti wants to lock X which is already locked by Tj.
Theorem: There is a deadlock iff the wait-for graph has a cycle.
Issues
When to run the algorithm
How to select the victims
Previous slide
Next slide
Back to first slide
View graphic version