DISTRIBUTED ALGORITHM FOR COMMUNICATION DEADLOCK DETECTION

In a distributed system, a set of processes may sometimes get involved in a communication deadlock. This is a situation where each process in the group waits for some process to communicate with it, but no other process is attempting communication. A new algorithm for deadlock detection in the communication model is presented. The proposed scheme is based on a new approach to the problem of distributed knot detection, which appears to be more efficient and simpler than existing ones. The resulting deadlock detection algorithm has the feature that when it terminates, the initiator knows all the processes that have caused the deadlock and may subsequently proceed to deadlock resolution.