Issue No. 01 - January (1995 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.363410
<p><it>Abstract—</it>This paper presents a fault-tolerant termination detection algorithm based on a previous fault-sensitive scheme by Dijkstra and Scholten. The proposed algorithm can tolerate any number of crash failures. It runs as efficiently as its nonfault-tolerant predecessor if no process actually fails during the computation, and otherwise incurs only a small amount of cost for each actual failure. It is assumed that the underlying communication network provides such services are reliable end-to-end communication, failure detection, and fail flush.</p><p><it>Index Terms—</it>Distributed algorithm, fault tolerance, message complexity, termination detection.</p>
T. Lai and L. Wu, "An (N -1)-Resilient Algorithm for Distributed Termination Detection," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 63-78, 1995.