Detection Using Waits-For Graph
Explicit deadlock detection - Use a Waits-For Graph
- Nodes = {transactions}
- Edges = {Ti ? Tk | Ti is waiting for Tk to release a lock}
- Example (previous deadlock) T1 T2
Theorem: If there’s a deadlock, then the waits-for graph has a cycle.