Exploiting logical structures in replicated databases
Information Processing Letters
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)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Fault-Tolerant Total Order Multicast to Asynchronous Groups
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
Consensus Based on Strong Failure Detectors: A Time and Message-Efficient Protocol
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Distributed Agreement and Its Relation with Error-Correcting Codes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
A Generic Framework for Indulgent Consensus
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Eventually consistent failure detectors
Journal of Parallel and Distributed Computing
Anonymous asynchronous systems: the case of failure detectors
DISC'10 Proceedings of the 24th international conference on Distributed computing
Eventually consistent failure detectors
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Signature-free broadcast-based intrusion tolerance: never decide a Byzantine value
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
The Asynchronous Bounded-Cycle model
Theoretical Computer Science
Building and using quorums despite any number of process of crashes
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Modeling and validating the performance of atomic broadcast algorithms in high latency networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
On the message complexity of indulgent consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
This paper addresses the Consensus problem in asynchronous distributed systems (made of n processes, at most f of them may crash) equipped with unreliable failure detectors. A generic Consensus protocol is presented: it is quorum-based and works with any failure detector belonging to the class S (provided that f ≤ n - 1) or to the class ⋄S (provided that f n/2). This quorum-based generic approach for solving the Consensus problem is new (to our knowledge). Moreover, the proposed protocol is conceptually simple, allows early decision and uses messages shorter than previous solutions. The generic dimension and the surprising design simplicity of the proposed protocol provide a better understanding of the basic algorithmic structures and principles that allow to solve the Consensus problem with the help of unreliable failure detectors.