Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
SIAM Journal on Computing
From binary consensus to multivalued consensus in asynchronous message-passing systems
Information Processing Letters
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 Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Information Processing Letters
Multi-sided shared coins and randomized set-agreement
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Convergence speed of binary interval consensus
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.89 |
In this paper, we present two bounded cost algorithms that solve multivalued consensus using binary consensus instances. Our first algorithm uses @?log"2n@? number of binary consensus instances where n is the number of processes, while our second algorithm uses at most 2k@? binary consensus instances, where k@? is the maximum length of the binary representation of all proposed values in the run. Both algorithms are significant improvements over the previous algorithm in [A. Mostefaoui, M. Raynal, F. Tronel, From binary consensus to multivalued consensus in asynchronous message-passing systems, Information Processing Letters 73 (5-6) (2000) 207-212], where the number of binary consensus instances needed to solve one multivalued consensus is unbounded.