A family of optimal termination detection algorithms

An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive and all channels have become empty. In this paper, we present a suite of algorithms for detecting termination of a non-diffusing computation for an arbitrary communication topology under a variety of conditions. All our termination detection algorithms have optimal message complexity. Furthermore, they have optimal detection latency when message processing time is ignored. Keywords Monitoring distributed system · Termination detection · Arbitrary communication topology · Optimal algorithm · Diffusing and non-diffusing computations · Simultaneous and delayed initiations · Single-hop and multi-hop application messages

• Type: Journal
• Year: 2007
• Where: DC
• Authors: Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
• Keywords: Arbitrary Communication Topology, Computations, DC 2001, DC 2007, Termination Detection