A Unified Proof of Minimum Time Complexity for Reaching Consensus and Uniform Consensus — An Oracle-Based Approach
Reliable Distributed Systems, IEEE Symposium on (2002)
Osaka University, Suita, Japan
Oct. 13, 2002 to Oct. 16, 2002
Jun Xu , Georgia Institute of Technology
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 induction proofs 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.
Consensus, uniform consensus, lower bounds, fault tolerance
J. Xu, "A Unified Proof of Minimum Time Complexity for Reaching Consensus and Uniform Consensus — An Oracle-Based Approach," Reliable Distributed Systems, IEEE Symposium on(SRDS), Osaka University, Suita, Japan, 2002, pp. 102.