File servers for network-based distributed systems
ACM Computing Surveys (CSUR)
Correctness proofs of distributed termination algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
A fully distributed (minimal) spanning tree algorithm
Information Processing Letters
Distributed termination in CSP: symmetric solutions with minimal storage
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
Termination detection for dynamically distributed systems with non-first-in-first-out communication
Journal of Parallel and Distributed Computing
A termination detection protocol and its formal verification
Journal of Parallel and Distributed Computing
A fully distributed termination detection scheme
Information Processing Letters
Parallel program design: a foundation
Parallel program design: a foundation
Timestamp-Based Orphan Elimination
IEEE Transactions on Software Engineering
An efficient distributed termination test
Information Processing Letters
A message-optimal algorithm for distributed termination detection
Journal of Parallel and Distributed Computing
Distributed termination detection with counters
Information Processing Letters
Termination detection by using distributed snapshots
Information Processing Letters
An assertional proof of Rana's algorithm
Information Processing Letters
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination Detection of Diffusing Computations in Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A Class of Termination Detection Algorithms For Distributed Computation
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Dynamic systems and their distributed termination
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Achieving Distributed Termination without Freezing
IEEE Transactions on Software Engineering
Tiered Algorithm for Distributed Process Quiescence and Termination Detection
IEEE Transactions on Parallel and Distributed Systems
Monitoring stable properties in dynamic peer-to-peer distributed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Stable predicate detection in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
A symmetric algorithm for detecting the termination of a distributed computation is presented. The algorithm does not require global information concerning the system and does not assume any communication features, barring finite delays in the delivery of messages. It permits dynamic creation and destruction of processes participating in the computation, and also permits destruction of a process by external processes, such as the OS kernel. It also provides for external processes spontaneously joining an ongoing computation. Proofs of safety and liveness are provided.