Achieving Distributed Termination without Freezing

Authors:
N. Francez;M. Rodeh
Affiliations:
Department of Computer Science, Technion-Israel Institute of Technology;-
Venue:
IEEE Transactions on Software Engineering
Year:
1982

Citing 0
Cited 5

Finite termination of asynchronous iterative algorithms

Parallel Computing
Distributed termination detection for dynamic systems

Parallel Computing
Scalable work stealing

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Lifeline-based global load balancing

Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Distributed termination of concurrent processes in Occam

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient algorithm for achieving distributed termination without introducing new communicaton channels and without delaying the basic computations ("freezing") is presented. The algorithm is related to the methodology of designing distributed programs where the programmer is relieved from the problem of distributed termination. An informal correctness proof and complexity analysis are included.