Method For Distributed Deadlock Detection
Original Publication Date: 1980-Nov-01
Included in the Prior Art Database: 2005-Feb-14
This invention relates to a method for detecting global deadlocks in a a distributed transaction processing system (one in which each transaction has a single unique identity, and is represented at each node in which it does work). The method is distributed, and reduces the message traffic associated with global deadlock detection. The method steps at each node comprise forming a graph which represents: - transaction waits-for transaction relationships at the node - transaction waits-for transaction relationships received from other nodes - transactions which are expected to send (ETS) to (ETS waits for these transactions), and - transactions which are waiting to receive (WTR) from (these transactions wait for WTR) the portion of the transaction at another node.