An Efficient Distributed Knot Detection Algorithm
IEEE Transactions on Software Engineering
A distributed deadlock detection algorithm for CSP-like communication
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Deadlock Avoidance Technique
IEEE Transactions on Computers
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model
IEEE Transactions on Software Engineering
On deadlocks of exclusive AND-requests for resources
Distributed Computing
Distributed algorithms for network diameter and girth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
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(n2+ 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.