Global quiescence detection based on credit distribution and recovery
Information Processing Letters
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
An (N -1)-Resilient Algorithm for Distributed Termination Detection
IEEE Transactions on Parallel and Distributed Systems
Detecting termination by weight-throwing in a faulty distributed system
Journal of Parallel and Distributed Computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
(Im)Possibilities of Predicate Detection in Crash-Affected Systems
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A Realistic Look At Failure Detectors
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
IEEE Transactions on Knowledge and Data Engineering
Failure detection and consensus in the crash-recovery model
Distributed Computing
Reliable and total order broadcast in the crash-recovery model
Journal of Parallel and Distributed Computing
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Efficient reduction for wait-free termination detection in a crash-prone distributed system
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On termination detection in crash-prone distributed systems with failure detectors
Journal of Parallel and Distributed Computing
Oracle-Based Flocking of Mobile Robots in Crash-Recovery Model
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Adoption protocols for fanout-optimal fault-tolerant termination detection
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Hi-index | 0.00 |
We investigate the problem of detecting termination of a distributed computation in an asynchronous message-passing system where processes may crash and recover. We show that it is impossible to solve the termination detection problem in this model. We identify necessary and sufficient conditions under which it is possible to solve the stabilizing version of the problem in which a termination detection algorithm is allowed to make finite number of mistakes. Finally, we present an algorithm to solve the stabilizing termination detection problem under these conditions.