Jayadev Misra
- 1 CHANDY, K.M., ANO MISRA, J. Distributed computation on graphs: Shortest path algorithms. Commun. ACM. 25, 11 (Nov. 1982). Google Scholar
- 2 CHA~a, E. Decentralized deadlock detection in distributed systems. Tech. Rep., Univ. of Victoria, Victoria, B.C., Canada.Google Scholar
- 3 DIJKST~, E.W. In reaction to Ernest Chang's Deadlock Detection. EWD702, Plataanstraat 5, 5671 AL Nuenen, The Netherlands, Feb. 21, 1979.Google Scholar
- 4 DtJKSTRA, E.W., A~D SCHOLTEN, C.S. Termination detection for diffusing computation. Inf. Process Lett. 11, 1 (Aug. 1980), 1-4.Google Scholar
Index Terms
- A Distributed Graph Algorithm: Knot Detection
Recommendations
A Distributed Algorithm for Knot Detection in a Distributed Graph
ICPP '02: Proceedings of the 2002 International Conference on Parallel ProcessingKnot detection in a distributed graph is an important problem and finds applications in several areas such as packet switching, distributed simulation, and distributed database systems. This paper presents a distributed algorithm to efficiently detect ...
An Efficient Distributed Knot Detection Algorithm
A distributed knot detection algorithm for general graphs is presented. The knot detection algorithm uses at most O(n log n+m) messages and O(m+n log n) bits of memory to detect all knots' nodes in the network (where n is the number of nodes and m is ...
Local distributed deadlock detection by knot detection
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 ...
Comments