A simple proof of the uniform consensus synchronous lower bound

Authors:
Idit Keidar;Sergio Rajsbaum
Affiliations:
MIT Lab for Computer Science, Cambridge, MA and Technion Department of Electrical Engineering, Haifa, Israel;Compaq Cambridge Research Laboratory, One Cambridge Center, Cambridge, MA
Venue:
Information Processing Letters
Year:
2003

Citing 11
Cited 16

Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures

Information and Computation
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Indulgent algorithms (preliminary version)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
On the cost of fault-tolerant consensus when there are no faults: preliminary version

ACM SIGACT News
Distributed Algorithms

Distributed Algorithms
Nonblocking commit protocols

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A Layered Analysis of Consensus

SIAM Journal on Computing
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus

WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Lower Bounds in Distributed Computing

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
The inherent cost of nonblocking commitment

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing

Uniform consensus is harder than consensus

Journal of Algorithms
Optimal early stopping uniform consensus in synchronous systems with process omission failures

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Group membership: a novel approach and the first single-round algorithm

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fast non-blocking atomic commit: an inherent trade-off

Information Processing Letters
Fast fault-tolerant agreement algorithms

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A bivalency proof of the lower bound for uniform consensus

Information Processing Letters
The inherent price of indulgence

Distributed Computing - Special issue: PODC 02
Message and time efficient consensus protocols for synchronous distributed systems

Journal of Parallel and Distributed Computing
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound

Theoretical Computer Science
A bivalency proof of the lower bound for uniform consensus

Information Processing Letters
Comparing the atomic commitment and consensus problems

Future directions in distributed computing
Open questions on consensus performance in well-behaved runs

Future directions in distributed computing
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity

DISC'09 Proceedings of the 23rd international conference on Distributed computing
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Strongly terminating early-stopping k-set agreement in synchronous systems with general omission failures

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Early-deciding consensus is expensive

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give a simple and intuitive proof of an f + 2 round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating t failures, and for every f ≤ t - 2, there is an execution with f failures that requires f + 2 rounds.