Distributed termination detection algorithm for distributed computations
Information Processing Letters
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
IEEE Transactions on Software Engineering
Termination detection for dynamically distributed systems with non-first-in-first-out communication
Journal of Parallel and Distributed Computing
Efficient algorithms for distributed simulation and related problems
Efficient algorithms for distributed simulation and related problems
A termination detection protocol and its formal verification
Journal of Parallel and Distributed Computing
The derivation of graph marking algorithms from distributed termination detection protocols
Science of Computer Programming
A fully distributed termination detection scheme
Information Processing Letters
Parallel program design: a foundation
Parallel program design: a foundation
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
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)
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Asynchronous distributed simulation via a sequence of parallel computations
Communications of the ACM - Special issue on simulation modeling and statistical computing
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Distributed Termination with Interval Assertions
Proceedings of the International Colloquium on Formalization of Programming Concepts
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
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Distributed State Exploration for Protocol Validation
Distributed State Exploration for Protocol Validation
A Paradigm for Detecting Quiescent Properties in Distributed Computations
A Paradigm for Detecting Quiescent Properties in Distributed Computations
On the Correctness of a Termination Detection Algorithm
On the Correctness of a Termination Detection Algorithm
Finite termination of asynchronous iterative algorithms
Parallel Computing
ARMI: an adaptive, platform independent communication library
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming
An efficient delay-optimal distributed termination detection algorithm
Journal of Parallel and Distributed Computing
Tiered Algorithm for Distributed Process Quiescence and Termination Detection
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Accessing and updating information in a self organizing data structure in a distributed environment requires execution of various distributed algorithms. Design of such algorithms is often facilitated by the use of a distributed termination detection algorithm superimposed on top of another distributed algorithm. The problem of distributed termination detection is considered, and message counting is introduced as an effective technique in designing such algorithms. A class of efficient algorithms, based on the idea of message counting, for this problem is presented. After termination has occurred, it is detected within a small number of message communications. These algorithms do not require the FIFO (first in, first out) property for the communication lines. Assumptions regarding the connectivity of the processes are simple. The algorithms are incrementally developed, i.e. a succession of algorithms leading to the final algorithms is presented.