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)
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
SIAM Journal on 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 hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Condition-Based Protocols for Set Agreement Problems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
The Best of Both Worlds: A Hybrid Approach to Solve Consensus
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
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
A Generic Framework for Indulgent Consensus
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Condition Adaptation in Synchronous Consensus
IEEE Transactions on Computers
Bosco: One-Step Byzantine Asynchronous Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On Replication of Software Transactional Memories
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Signature-free broadcast-based intrusion tolerance: never decide a Byzantine value
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
One-step consensus solvability
DISC'06 Proceedings of the 20th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Generating fast atomic commit from hyperfast consensus
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
| Hi-index | 0.00 |
This paper presents a very simple consensus protocol that converges in a single communication step in favorable circumstances. Those situations occur when "enough" processes propose the same value. ("Enough" means "at least (n-f)" where f is the maximum number of processes that can crash in a set of n processes.) The protocol requires f n/3. It is shown that this requirement is necessary. Moreover, if all the processes that propose a value do propose the same value, the protocol always terminates in one communication step. It is also shown that additional assumptions can help weaken the f n/3 requirement to f n/2.