An Algorithm for Solving the Distributed Termination Detection Problem

In this paper we present an algorithm for solving the distributed termination detection problem. In particular, a strategy based on message counting is used to detect the termination of a distributed computation consisting of a set of processes asynchronously communicating over communication links. The proposed algorithm does not require the FIFO property for the communication links. The assumptions regarding the connectivity of the processes are very simple. For the proposed algorithm we demonstrate the correctness, we evaluate the message and the bit complexity and we give a detailed description of a MPI implementation.