Deadlock Detection
Build a wait-for graph and periodically look for cycles, to find the circular wait condition
The wait-for graph contains:
- nodes, corresponding to processes
- directed edges, corresponding to a resource held by one process and desired by the other