A Class of Termination Detection Algorithms For Distributed Computation

We present a class of efficient algorithms for termination detection in a distributed system. These algorithms do not require the FIFO property for the communication channels. Assumptions regarding the connectivity of the processes are simple. Messages for termination detection are processed and sent out from a process only when it is idle. Thus it is expected that these messages would not interfere much with the underlying computation, i.e., the computation not related to termination detection. The messages have a fixed, short length. After termination has occurred, it is detected within a small number of message communications.

[1]  K. Mani Chandy,et al.  Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

[2]  Richard C. Holt,et al.  Some Deadlock Properties of Computer Systems , 1972, CSUR.

[3]  K. Mani Chandy,et al.  Termination Detection of Diffusing Computations in Communicating Sequential Processes , 1982, TOPL.

[4]  Jayadev Misra,et al.  A Paradigm for Detecting Quiescent Properties in Distributed Computations , 1989, Logics and Models of Concurrent Systems.

[5]  K M Chandy,et al.  A Distributed Procedure to Detect and/or Deadlock. , 1983 .

[6]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[7]  Mohamed G. Gouda,et al.  Distributed State Exploration for Protocol Validation , 1981 .

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  Nissim Francez,et al.  Distributed Termination , 1980, TOPL.

[10]  Sam Toueg,et al.  A distributed algorithm for generalized deadlock detection , 1984, PODC '84.

[11]  Ron Obermarck,et al.  Distributed deadlock detection algorithm , 1982, TODS.

[12]  K. Mani Chandy,et al.  A distributed algorithm for detecting resource deadlocks in distributed systems , 1982, PODC '82.

[13]  Virgil D. Gligor,et al.  On Deadlock Detection in Distributed Systems , 1980, IEEE Transactions on Software Engineering.

[14]  Laura M. Haas,et al.  Distributed deadlock detection , 1983, TOCS.

[15]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[16]  K. Mani Chandy,et al.  Distributed computation on graphs: shortest path algorithms , 1982, CACM.

[17]  Jayadev Misra,et al.  Detecting termination of distributed computations using markers , 1983, PODC '83.

[18]  Catriel Beeri,et al.  A Resource Class Independent Deadlock Detection Algorithm , 1981, VLDB.

[19]  K. Mani Chandy,et al.  A Distributed Graph Algorithm: Knot Detection , 1982, TOPL.

[20]  K. Mani Chandy,et al.  Asynchronous distributed simulation via a sequence of parallel computations , 1981, CACM.

[21]  Ernest J. H. Chang,et al.  Echo Algorithms: Depth Parallel Operations on General Graphs , 1982, IEEE Transactions on Software Engineering.

[22]  Michael Rodeh,et al.  Distributed Termination with Interval Assertions , 1981, ICFPC.

[23]  Daniel Lehmann,et al.  Dynamic systems and their distributed termination , 1982, PODC '82.

[24]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[25]  Michael Rodeh,et al.  Achieving Distributed Termination without Freezing , 1982, IEEE Transactions on Software Engineering.