The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1995 vol.6)
pp: 63-78
ABSTRACT
<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>
CITATION
Ten-Hwang Lai, Li-Fen Wu, "An (N -1)-Resilient Algorithm for Distributed Termination Detection", IEEE Transactions on Parallel & Distributed Systems, vol.6, no. 1, pp. 63-78, January 1995, doi:10.1109/71.363410
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool