Polynomial algorithms for multiple processor agreement

Danny Dolev; H. Raymond Strong

doi:10.1145/800070.802215

Polynomial algorithms for multiple processor agreement

Danny Dolev, H. Raymond Strong

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

89 Scopus citations

Abstract

Reaching agreement in a distributed system while handling malfunctioning behavior is a central issue for reliable computer systems. All previous algorithms for reaching the agreement required an exponential number of messages to be sent, with or without authentication. We give polynomial algorithms for reaching (Byzantine) agreement, both with and without the use of authentication protocols. We also prove that no matter what kind of information is exchanged, there is no way to reach agreement with fewer than t+1 rounds of exchange, where t is the upper bound on the number of faults.

Original language	English
Title of host publication	Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982
Publisher	Association for Computing Machinery
Pages	401-407
Number of pages	7
ISBN (Print)	0897910702
DOIs	https://doi.org/10.1145/800070.802215
State	Published - 5 May 1982
Externally published	Yes
Event	14th Annual ACM Symposium on Theory of Computing, STOC 1982 - San Francisco, United States Duration: 5 May 1982 → 7 May 1982

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)	0737-8017

Conference

Conference	14th Annual ACM Symposium on Theory of Computing, STOC 1982
Country/Territory	United States
City	San Francisco
Period	5/05/82 → 7/05/82

Bibliographical note

Publisher Copyright:
© 1982 ACM.

Access to Document

10.1145/800070.802215

Cite this

@inproceedings{7972c289bc6b4872884a4f4a8e2f6931,

title = "Polynomial algorithms for multiple processor agreement",

abstract = "Reaching agreement in a distributed system while handling malfunctioning behavior is a central issue for reliable computer systems. All previous algorithms for reaching the agreement required an exponential number of messages to be sent, with or without authentication. We give polynomial algorithms for reaching (Byzantine) agreement, both with and without the use of authentication protocols. We also prove that no matter what kind of information is exchanged, there is no way to reach agreement with fewer than t+1 rounds of exchange, where t is the upper bound on the number of faults.",

author = "Danny Dolev and Strong, {H. Raymond}",

note = "Publisher Copyright: {\textcopyright} 1982 ACM.; 14th Annual ACM Symposium on Theory of Computing, STOC 1982 ; Conference date: 05-05-1982 Through 07-05-1982",

year = "1982",

month = may,

day = "5",

doi = "10.1145/800070.802215",

language = "אנגלית",

isbn = "0897910702",

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

publisher = "Association for Computing Machinery",

pages = "401--407",

booktitle = "Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982",

}

Dolev, D & Strong, HR 1982, Polynomial algorithms for multiple processor agreement. in Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 401-407, 14th Annual ACM Symposium on Theory of Computing, STOC 1982, San Francisco, United States, 5/05/82. https://doi.org/10.1145/800070.802215

Polynomial algorithms for multiple processor agreement. / Dolev, Danny; Strong, H. Raymond.
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982. Association for Computing Machinery, 1982. p. 401-407 (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

TY - GEN

T1 - Polynomial algorithms for multiple processor agreement

AU - Dolev, Danny

AU - Strong, H. Raymond

PY - 1982/5/5

Y1 - 1982/5/5

N2 - Reaching agreement in a distributed system while handling malfunctioning behavior is a central issue for reliable computer systems. All previous algorithms for reaching the agreement required an exponential number of messages to be sent, with or without authentication. We give polynomial algorithms for reaching (Byzantine) agreement, both with and without the use of authentication protocols. We also prove that no matter what kind of information is exchanged, there is no way to reach agreement with fewer than t+1 rounds of exchange, where t is the upper bound on the number of faults.

AB - Reaching agreement in a distributed system while handling malfunctioning behavior is a central issue for reliable computer systems. All previous algorithms for reaching the agreement required an exponential number of messages to be sent, with or without authentication. We give polynomial algorithms for reaching (Byzantine) agreement, both with and without the use of authentication protocols. We also prove that no matter what kind of information is exchanged, there is no way to reach agreement with fewer than t+1 rounds of exchange, where t is the upper bound on the number of faults.

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

U2 - 10.1145/800070.802215

DO - 10.1145/800070.802215

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

AN - SCOPUS:85051365925

SN - 0897910702

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 401

EP - 407

BT - Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982

PB - Association for Computing Machinery

T2 - 14th Annual ACM Symposium on Theory of Computing, STOC 1982

Y2 - 5 May 1982 through 7 May 1982

ER -

Polynomial algorithms for multiple processor agreement

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this