Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32056
Title: A bivalency proof of the lower bound for uniform consensus
Authors: Wang, X
Teo, YM
Cao, J 
Keywords: Bivalency argument
Distributed computing
Synchronous distributed systems
Uniform consensus
Issue Date: 2005
Source: Information processing letters, 2005, v. 96, no. 5, p. 167-174 How to cite?
Journal: Information Processing Letters 
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≤f≤t-2.
URI: http://hdl.handle.net/10397/32056
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2005.08.002
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of Aug 21, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Aug 22, 2017

Page view(s)

30
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.