A taxonomy of distributed termination detection algorithms

An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult problem due to the fact that there is no simple way of gaining knowledge of the global state of the system. Of the algorithms proposed in the last 15 years, there are many similarities. We have categorized these algorithms based on the following factors: algorithm type (e.g., wave, credit-recovery), required network topology, algorithm symmetry, required process knowledge, communication protocol (synchronous or asynchronous), communication channel behavior (®rst-in ®rst-out (FIFO) or non-FIFO), message optimality, and fault tolerance. This methodology is intended to guide future research in DTD algorithms (since research continues on these algorithms) as well as to provide a classi®cation survey for this area. Ó 1998 Elsevier Science Inc. All rights reserved.

• Type: Journal
• Year: 1998
• Where: JSS
• Authors: Jeff Matocha, Tracy Camp
• Keywords: Algorithms, Distributed Computation, Important Problem, JSS 1998