k-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Time and message-efficient S-based consensus (brief announcement)
Proceedings of the nineteenth 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
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
IEEE Transactions on Computers
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
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
Design and performance of a generic consensus component for critical distributed applications
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
| Hi-index | 0.02 |
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes satisfying Perpetual Accuracy property is first defined. This family includes the failure detector class S (the class of Strong failure detectors defined by Chandra and Toueg) central to the definition of a class Sx where x is the minimum number (x greater or equal to 1) of correct processes that can never be suspected to have crashed.Then, a protocol that solves the Consensus problem is given. This protocol works with any failure detector class (Sx) of this family. It is particularly simple and uses a Reliable Broadcast protocol as a skeleton. It requires (n-x+1) communication steps, and its communication bit complexity is (n-x+1)(n-1)|v| (where |v| is the maximal size of an initial value a process can propose).