Deadlock Detection

What
Deadlock detection is a strategy for handling? deadlocks ? where we allow deadlocks to happen but we periodically check to correct them

Strategy
We? create a? '''waits-for? '''graph where: We periodically check for cycles in the graph. If a cycle is found, then we remove a node such that the cycle will be broken.
 * Nodes are transactions
 * Edges go from $$T_i$$ to $$T_j$$ if $$T_I$$ is waiting for a lock to be released by $$T_j$$