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)
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing
Future directions in distributed computing
| Hi-index | 0.01 |
It is now well recognized that the consensus problem is a fundamental problem when one has to implement fault-tolerant distributed services in asynchronous distributed systems prone to process crash failures. This paper considers binary consensus and multivalued consensus (a consensus is binary when only two values can be proposed by processes, it is multivalued otherwise).Following an approach investigated by Aguilera and Toueg, the paper first proposes a simple binary consensus protocol that combines failure detection and randomization. This protocol terminates deterministically when the failure detection mechanism works correctly. It terminates with probability 1, otherwise.Then, the paper presents a simple protocol that solves the multivalued consensus problem with the help of a binary consensus. This transformation protocol actually combines a reliable broadcast protocol with a binary (e.g., randomized) consensus protocol. Consequently, this protocol provides a solution to the multivalued consensus problem that is not failure detector-based. It is important to note that the proposed protocols are both efficient and simple.