Achieving Distributed Termination without Freezing
- 1 May 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-8 (3), 287-292
- https://doi.org/10.1109/tse.1982.235257
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.Keywords
This publication has 9 references indexed in Scilit:
- Distributed termination with interval assertionsLecture Notes in Computer Science, 1981
- Termination detection for diffusing computationsInformation Processing Letters, 1980
- A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1980
- Distributed TerminationACM Transactions on Programming Languages and Systems, 1980
- Semantics of nondeterminism, concurrency, and communicationJournal of Computer and System Sciences, 1979
- Concurrent Processes and Their SyntaxJournal of the ACM, 1979
- Distributed processesCommunications of the ACM, 1978
- Communicating sequential processesCommunications of the ACM, 1978
- Programming Distributed SystemsPublished by Association for Computing Machinery (ACM) ,1978