More efficient message-optimal algorithm for distributed termination detection

Ten Hwang Lai*, Yu-Chee Tseng, Xuefeng Dong

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

Termination detection is a fundamental problem in distributed computing. Many algorithms have been proposed, but only the Chandrasekaran and Venkatesan (CV) algorithm is known to be optimal in worst-case message complexity. This optimal algorithm, however, has several undesirable properties. First, it always requires M′+2*|E|+n-1 control messages, whether it is worst case or best case, where M′ is the number of basic messages issued by the underlying computation after the algorithm starts, |E| is the number of channels in the system, and n is the number of processes. Second, its worst-case detection delay is O(M′). In a message-intensive computation, that might not be tolerable. Third, the maximum amount of space needed by each process is O(M′), a quantity not known at compile time, making it necessary to use the more expensive dynamic memory allocation. Last, it works only for FIFO channels. The purpose of this paper is to remedy these drawbacks, while keeping its strength. We propose an algorithm that requires M′+2(n-1) control messages in the worst case, but much fewer on the average, and in the best case, it uses only 2(n-1) control messages, no matter how large M′ is. The worst-case detection delay is O(n), as compared to the CV-algorithm's O(M′); and the space complexity is Θ(n) for each process, a compile-time known quantity. The algorithm works equally well for both FIFO and Non-FIFO channels.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherPubl by IEEE
Pages646-649
Number of pages4
ISBN (Print)0818626720
DOIs
StatePublished - 1 Dec 1992
EventProceedings of the 6th International Parallel Processing Symposium - Beverly Hills, CA, USA
Duration: 23 Mar 199226 Mar 1992

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Conference

ConferenceProceedings of the 6th International Parallel Processing Symposium
CityBeverly Hills, CA, USA
Period23/03/9226/03/92

Fingerprint Dive into the research topics of 'More efficient message-optimal algorithm for distributed termination detection'. Together they form a unique fingerprint.

Cite this