Tight bounds for shared memory systems accessed by byzantine processes

Michael Merritt; Omer Reingold; Gadi Taubenfeld; Rebecca N. Wright

doi:10.1007/3-540-36108-1_15

Tight bounds for shared memory systems accessed by byzantine processes

Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright

Computer Science discipline

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

Abstract

We provide efficient constructions and tight bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine faults, in a model previously explored by Malkhi et al. [MMRT00]. We show that sticky bits are universal in the Byzantine failure model for n ≥ 3t + 1, an improvement over the previous result requiring n ≥ (2t+1)(t+1). Our result follows from a new strong consensus construction that uses sticky bits and tolerates t Byzantine failures among n processes for any n ≥ 3t + 1, the best possible bound on n for strong consensus. We also present tight bounds on the efficiency of implementations of strong consensus objects from sticky bits and similar primitive objects.

Original language	English
Title of host publication	Distributed Computing - 16th International Conference, DISC 2002, Proceedings
Editors	Dahlia Malkhi
Publisher	Springer Verlag
Pages	222-236
Number of pages	15
ISBN (Print)	3540000739, 9783540000730
DOIs	https://doi.org/10.1007/3-540-36108-1_15
State	Published - 2002
Event	16th International Conference on Distributed Computing, DISC 2002 - Toulouse, France Duration: 28 Oct 2002 → 30 Oct 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2508
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	16th International Conference on Distributed Computing, DISC 2002
Country/Territory	France
City	Toulouse
Period	28/10/02 → 30/10/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Access to Document

10.1007/3-540-36108-1_15

Cite this

Merritt, M., Reingold, O., Taubenfeld, G., & Wright, R. N. (2002). Tight bounds for shared memory systems accessed by byzantine processes. In D. Malkhi (Ed.), Distributed Computing - 16th International Conference, DISC 2002, Proceedings (pp. 222-236). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2508). Springer Verlag. https://doi.org/10.1007/3-540-36108-1_15

Merritt, Michael ; Reingold, Omer ; Taubenfeld, Gadi et al. / Tight bounds for shared memory systems accessed by byzantine processes. Distributed Computing - 16th International Conference, DISC 2002, Proceedings. editor / Dahlia Malkhi. Springer Verlag, 2002. pp. 222-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6043e95758094db8bd4645668f34aa09,

title = "Tight bounds for shared memory systems accessed by byzantine processes",

abstract = "We provide efficient constructions and tight bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine faults, in a model previously explored by Malkhi et al. [MMRT00]. We show that sticky bits are universal in the Byzantine failure model for n ≥ 3t + 1, an improvement over the previous result requiring n ≥ (2t+1)(t+1). Our result follows from a new strong consensus construction that uses sticky bits and tolerates t Byzantine failures among n processes for any n ≥ 3t + 1, the best possible bound on n for strong consensus. We also present tight bounds on the efficiency of implementations of strong consensus objects from sticky bits and similar primitive objects.",

author = "Michael Merritt and Omer Reingold and Gadi Taubenfeld and Wright, {Rebecca N.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 16th International Conference on Distributed Computing, DISC 2002 ; Conference date: 28-10-2002 Through 30-10-2002",

year = "2002",

doi = "10.1007/3-540-36108-1_15",

language = "אנגלית",

isbn = "3540000739",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "222--236",

editor = "Dahlia Malkhi",

booktitle = "Distributed Computing - 16th International Conference, DISC 2002, Proceedings",

address = "גרמניה",

}

Merritt, M, Reingold, O, Taubenfeld, G & Wright, RN 2002, Tight bounds for shared memory systems accessed by byzantine processes. in D Malkhi (ed.), Distributed Computing - 16th International Conference, DISC 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2508, Springer Verlag, pp. 222-236, 16th International Conference on Distributed Computing, DISC 2002, Toulouse, France, 28/10/02. https://doi.org/10.1007/3-540-36108-1_15

Tight bounds for shared memory systems accessed by byzantine processes. / Merritt, Michael; Reingold, Omer; Taubenfeld, Gadi et al.
Distributed Computing - 16th International Conference, DISC 2002, Proceedings. ed. / Dahlia Malkhi. Springer Verlag, 2002. p. 222-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2508).

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

TY - GEN

T1 - Tight bounds for shared memory systems accessed by byzantine processes

AU - Merritt, Michael

AU - Reingold, Omer

AU - Taubenfeld, Gadi

AU - Wright, Rebecca N.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

N2 - We provide efficient constructions and tight bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine faults, in a model previously explored by Malkhi et al. [MMRT00]. We show that sticky bits are universal in the Byzantine failure model for n ≥ 3t + 1, an improvement over the previous result requiring n ≥ (2t+1)(t+1). Our result follows from a new strong consensus construction that uses sticky bits and tolerates t Byzantine failures among n processes for any n ≥ 3t + 1, the best possible bound on n for strong consensus. We also present tight bounds on the efficiency of implementations of strong consensus objects from sticky bits and similar primitive objects.

AB - We provide efficient constructions and tight bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine faults, in a model previously explored by Malkhi et al. [MMRT00]. We show that sticky bits are universal in the Byzantine failure model for n ≥ 3t + 1, an improvement over the previous result requiring n ≥ (2t+1)(t+1). Our result follows from a new strong consensus construction that uses sticky bits and tolerates t Byzantine failures among n processes for any n ≥ 3t + 1, the best possible bound on n for strong consensus. We also present tight bounds on the efficiency of implementations of strong consensus objects from sticky bits and similar primitive objects.

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

U2 - 10.1007/3-540-36108-1_15

DO - 10.1007/3-540-36108-1_15

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

AN - SCOPUS:27844482018

SN - 3540000739

SN - 9783540000730

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 222

EP - 236

BT - Distributed Computing - 16th International Conference, DISC 2002, Proceedings

A2 - Malkhi, Dahlia

PB - Springer Verlag

T2 - 16th International Conference on Distributed Computing, DISC 2002

Y2 - 28 October 2002 through 30 October 2002

ER -

Merritt M, Reingold O, Taubenfeld G, Wright RN. Tight bounds for shared memory systems accessed by byzantine processes. In Malkhi D, editor, Distributed Computing - 16th International Conference, DISC 2002, Proceedings. Springer Verlag. 2002. p. 222-236. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-36108-1_15

Tight bounds for shared memory systems accessed by byzantine processes

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this