A bivalency proof of the lower bound for uniform consensus

Authors:
Xianbing Wang;Yong Meng Teo;Jiannong Cao
Affiliations:
Singapore-Massachusetts Institute of Technology Alliance, 117576 Singapore;Singapore-Massachusetts Institute of Technology Alliance, 117576 Singapore and Department of Computer Science, National University of Singapore, 117543 Singapore;Department of Computing, Hong Kong Polytechnic University, Hong Kong
Venue:
Information Processing Letters
Year:
2005

Citing 9
Cited 0

Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unifying synchronous and asynchronous message-passing models

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms

Distributed Algorithms
A Layered Analysis of Consensus

SIAM Journal on Computing
A simple proof of the uniform consensus synchronous lower bound

Information Processing Letters
A Unified Proof of Minimum Time Complexity for Reaching Consensus and Uniform Consensus " An Oracle-Based Approach

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Uniform consensus is harder than consensus

Journal of Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

Bivalency argument is a widely-used technique that employs forward induction to show impossibility results and lower bounds related to consensus. However, for a synchronous distributed system of n processes with up to t potential and f actual crash failures, applying bivalency argument to prove the lower bound for reaching uniform consensus is still an open problem. In this paper, we address this problem by presenting a bivalency proof that the lower bound for reaching uniform consensus is (f+2)-rounds where 0=