A More Efficient Message-Optimal Algorithm for Distributed Termination Detection

@inproceedings{Lai1992AME,
  title={A More Efficient Message-Optimal Algorithm for Distributed Termination Detection},
  author={Ten-Hwang Lai and Yu-Chee Tseng and Xuefeng Dong},
  booktitle={IPPS},
  year={1992}
}
Termination detection is a fundamental problem in distributed computing. Many algorithms have been proposed, but only the Chandrasekaran and Venkatesan (CV) algorithm [l] is known to be optimal in worst-case message complexity. This optimal algorithm, however, has several undesirable properties. First, it always requires M’ + 2 * IEl+ n 1 control messages, whether it is worst case o r best case, where M’ is the number of basic messages issued b y the underlying computation after the algorithm… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Termination for Distributed Systems with Asynchronous Message Passing: Model and Cost

  • B. Rozoy
  • Laboratoire d’hformatique,
  • 1987

How Processes Learn, Distributed Computing

  • K. M. Chandy, J . Misra
  • 1986

A Class of Termination Detection Algorithms for Distributed Computations

  • D. Kumar
  • Tech. Rep. TR-85-07, Dept. of Computer Sciences…
  • 1985

Similar Papers

Loading similar papers…