Issue No.01 - January (1987 vol.13)
I. Cidon , IBM Thomas J. Watson Research Center
A distributed algorithm for the detection of deadlocks in store-and-forward communication networks is presented. At first, we focus on a static environment and develop an efficient knot detection algorithm for general graphs. The knot detection algorithm uses at most O(n<sup>2</sup>+ m) messages and O(log (n)) bits of memory to detect all deadlocked nodes in the static network. Using the knot detection algorithm as a building block, a deadlock detection algorithm in a dynamic environment is developed. This algorithm has the following properties: It detects all the nodes which cause the deadlock. The algorithm is triggered only when there is a potential for deadlock and only those nodes which are potentially deadlocked perform the algorithm. The algorithm does not affect other processes at the nodes.
distributed algorithms, Clustering, computer networks, cycle detection, deadlock detection
I. Cidon, J.M. Jaffe, M. Sidi, "Local Distributed Deadlock Detection by Cycle Detection and Clusterng", IEEE Transactions on Software Engineering, vol.13, no. 1, pp. 3-14, January 1987, doi:10.1109/TSE.1987.232560