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

Authors:
Jun Xu
Affiliations:
-
Venue:
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Year:
2002

Citing 0
Cited 3

A bivalency proof of the lower bound for uniform consensus

Information Processing Letters
Message and time efficient consensus protocols for synchronous distributed systems

Journal of Parallel and Distributed Computing
A bivalency proof of the lower bound for uniform consensus

Information Processing Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we offer new proofs to two lower bound results in distributed computing: a minimum of f +1 and f +2 rounds for reaching consensus and uniform consensus respectively when at most f fail-stop faults can happen. Here the computation model is synchronous message passing. Both proofs are based on a novel oracle argument. These two inductionproofs are unified in the following sense: the induction steps are the same and only the initial step (f=0) needs to be proved separately. The techniques used in the proof offer new insights into the lower bound results in distributed computing.