An (N-1)-resilient algorithm for distributed termination detection

The authors propose a fault-tolerant algorithm for termination detection that can tolerate any number of stop failures. This algorithm improves on existing ones in many aspects, including worst-case message complexity, average-case message complexity and storage overhead. Most important, it runs as efficiently as the best non-fault-tolerant algorithm available if no process fails during the computation, and incurs only a reasonable amount of cost for each process failure that actually occurs. The main idea of the algorithm is a barrier set at a particular process. It is possible that other termination detection algorithms can be made fault-tolerant using similar techniques.<>