Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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 Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors
IEEE Transactions on Computers
Fast Indulgent Consensus with Zero Degradation
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Consensus in One Communication Step
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Proceedings of the 13th International Symposium on Distributed Computing
A Versatile and Modular Consensus Protoco
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Efficient adaptive collect using randomization
Distributed Computing - Special issue: DISC 04
The building blocks of consensus
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Replication predicates for dependent-failure algorithms
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Consensus is a fundamental distributed agreement problemthat has to be solved when one has to design or implementreliable applications. As consensus cannot be solvedin pure asynchronous distributed systems, those systemshave to be equipped with appropriate oracles to circumventthe impossibility. Several oracles (unreliable failure detector,leader capability, random number generator) have beenproposed, and consensus protocols based on such ad hoc oracleshave been designed. This paper presents a genericconsensus framework that can be instantiated with any oracle,or combination of oracles, that satisfies a set of properties.This generic framework provides indulgent consensusprotocols that are particularly simple and efficient both inwell-behaved runs (i.e., when there are no failures), and instable runs (i.e., when there is no failure during the executionalthough some processes can be initially crashed). Inthose runs, the protocols terminate in two communicationsteps (which is optimal). Indulgence means that the resultingprotocol never violates its safety property even whenthe underlying oracle behaves arbitrarily. Interestingly, theprotocol can also allow processes to decide in one communicationstep in some specific configurations.