Bounded polynomial randomized consensus

Hagit Attiya; Danny Dolev; Nir Shavit

doi:10.1145/72981.73001

Bounded polynomial randomized consensus

Hagit Attiya^*, Danny Dolev, Nir Shavit

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

33 Scopus citations

Abstract

K. Abrahamson presented a solution to the randomized consensus problem of B. Chor, A. Israeli and M. Li, without assuming the existence of an atomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected exponential running time. J. Aspens and M.P. Herlihy provided a breakthrough polynomial-time algorithm. However, it too is based on the use of unbounded memory. In this paper, we present a solution to the randomized consensus problem that is bounded in space and runs in polynomial expected time.

Original language	English
Title of host publication	Proc Eighth ACM Symp Princ Distrib Comput
Publisher	Publ by ACM
Pages	281-293
Number of pages	13
ISBN (Print)	0897913264, 9780897913263
DOIs	https://doi.org/10.1145/72981.73001
State	Published - 1989
Event	Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing - Edmonton, Alberta, Can Duration: 14 Aug 1989 → 16 Aug 1989

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing
City	Edmonton, Alberta, Can
Period	14/08/89 → 16/08/89

Access to Document

10.1145/72981.73001

Cite this

@inproceedings{03a13adafaf644aea7b92542ace25726,

title = "Bounded polynomial randomized consensus",

abstract = "K. Abrahamson presented a solution to the randomized consensus problem of B. Chor, A. Israeli and M. Li, without assuming the existence of an atomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected exponential running time. J. Aspens and M.P. Herlihy provided a breakthrough polynomial-time algorithm. However, it too is based on the use of unbounded memory. In this paper, we present a solution to the randomized consensus problem that is bounded in space and runs in polynomial expected time.",

author = "Hagit Attiya and Danny Dolev and Nir Shavit",

year = "1989",

doi = "10.1145/72981.73001",

language = "אנגלית",

isbn = "0897913264",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Publ by ACM",

pages = "281--293",

booktitle = "Proc Eighth ACM Symp Princ Distrib Comput",

note = "Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 14-08-1989 Through 16-08-1989",

}

Attiya, H, Dolev, D & Shavit, N 1989, Bounded polynomial randomized consensus. in Proc Eighth ACM Symp Princ Distrib Comput. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Publ by ACM, pp. 281-293, Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Can, 14/08/89. https://doi.org/10.1145/72981.73001

TY - GEN

T1 - Bounded polynomial randomized consensus

AU - Attiya, Hagit

AU - Dolev, Danny

AU - Shavit, Nir

PY - 1989

Y1 - 1989

N2 - K. Abrahamson presented a solution to the randomized consensus problem of B. Chor, A. Israeli and M. Li, without assuming the existence of an atomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected exponential running time. J. Aspens and M.P. Herlihy provided a breakthrough polynomial-time algorithm. However, it too is based on the use of unbounded memory. In this paper, we present a solution to the randomized consensus problem that is bounded in space and runs in polynomial expected time.

AB - K. Abrahamson presented a solution to the randomized consensus problem of B. Chor, A. Israeli and M. Li, without assuming the existence of an atomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected exponential running time. J. Aspens and M.P. Herlihy provided a breakthrough polynomial-time algorithm. However, it too is based on the use of unbounded memory. In this paper, we present a solution to the randomized consensus problem that is bounded in space and runs in polynomial expected time.

UR - http://www.scopus.com/inward/record.url?scp=0024933357&partnerID=8YFLogxK

U2 - 10.1145/72981.73001

DO - 10.1145/72981.73001

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0024933357

SN - 0897913264

SN - 9780897913263

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 281

EP - 293

BT - Proc Eighth ACM Symp Princ Distrib Comput

PB - Publ by ACM

T2 - Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing

Y2 - 14 August 1989 through 16 August 1989

ER -

Bounded polynomial randomized consensus

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this