Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors
IEEE Transactions on Computers
An introduction to oracles for asynchronous distributed systems
Future Generation Computer Systems - Parallel computing technologies (PaCT-2001)
A Condition for k-Set Agreement in Asynchronous Distributed Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Consensus in One Communication Step
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing
Bounded cost algorithms for multivalued consensus using binary consensus instances
Information Processing Letters
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Information Processing Letters
Future directions in distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
Adaptive fault monitoring in fault tolerant CORBA
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
| Hi-index | 0.01 |
We present a consensus algorithm that combines unreliable failure detection and randomization, two well-known techniques for solving consensus in asynchronous systems with crash failures. This hybrid algorithm combines advantages from both approaches: it guarantees deterministic termination if the failure detector is accurate, and probabilistic termination otherwise. In executions with no failures or failure detector mistakes, the most likely ones in practice, consensus is reached in only two asynchronous rounds.