Tight lower bound for randomized synchronous consensus

Ziv Bar-Joseph; Michael Ben-Or

Tight lower bound for randomized synchronous consensus

Ziv Bar-Joseph^*
, Michael Ben-Or

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to conference › Paper › peer-review

53 Scopus citations

Abstract

We prove tight upper and lower bounds of Θ(t/√n log n) on the expected number of rounds needed for randomized synchronous consensus protocols for a fail-stop, full information, dynamic adversary. In particular this proves that some restrictions are needed on the power of the adversary to allow randomized constant expected number of rounds protocols.

Original language	English
Pages	193-200
Number of pages	8
State	Published - 1998
Event	Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing - Puerto Vallarta, Mexico Duration: 28 Jun 1998 → 2 Jul 1998

Conference

Conference	Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing
City	Puerto Vallarta, Mexico
Period	28/06/98 → 2/07/98

Cite this

@conference{b8e32bb6d4c24773abbcedb6425de020,

title = "Tight lower bound for randomized synchronous consensus",

abstract = "We prove tight upper and lower bounds of Θ(t/√n log n) on the expected number of rounds needed for randomized synchronous consensus protocols for a fail-stop, full information, dynamic adversary. In particular this proves that some restrictions are needed on the power of the adversary to allow randomized constant expected number of rounds protocols.",

author = "Ziv Bar-Joseph and Michael Ben-Or",

year = "1998",

language = "אנגלית",

pages = "193--200",

note = "Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 28-06-1998 Through 02-07-1998",

}

TY - CONF

T1 - Tight lower bound for randomized synchronous consensus

AU - Bar-Joseph, Ziv

AU - Ben-Or, Michael

PY - 1998

Y1 - 1998

N2 - We prove tight upper and lower bounds of Θ(t/√n log n) on the expected number of rounds needed for randomized synchronous consensus protocols for a fail-stop, full information, dynamic adversary. In particular this proves that some restrictions are needed on the power of the adversary to allow randomized constant expected number of rounds protocols.

AB - We prove tight upper and lower bounds of Θ(t/√n log n) on the expected number of rounds needed for randomized synchronous consensus protocols for a fail-stop, full information, dynamic adversary. In particular this proves that some restrictions are needed on the power of the adversary to allow randomized constant expected number of rounds protocols.

UR - https://www.scopus.com/pages/publications/0031630330

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0031630330

SP - 193

EP - 200

T2 - Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing

Y2 - 28 June 1998 through 2 July 1998

ER -

Tight lower bound for randomized synchronous consensus

Abstract

Conference

Other files and links

Fingerprint

Cite this