Wait-free consensus using asynchronous hardware

Benny Chor; Amos Israeli; Ming Li

doi:10.1137/S0097539790192635

Wait-free consensus using asynchronous hardware

Benny Chor^*, Amos Israeli, Ming Li

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

This paper studies the wait-free consensus problem in the asynchronous shared memory model. In this model, processors communicate by shared registers that allow atomic read and write operations (but do not support atomic test-and-set). It is known that the wait-free consensus problem cannot be solved by deterministic protocols. A randomized solution is presented. This protocol is simple, constructive, tolerates up to n - 1 processors crashes (where n is the number of processors), and its expected run-time is O(n²).

Original language	English
Pages (from-to)	701-712
Number of pages	12
Journal	SIAM Journal on Computing
Volume	23
Issue number	4
DOIs	https://doi.org/10.1137/S0097539790192635
State	Published - 1994
Externally published	Yes

Access to Document

10.1137/S0097539790192635

Cite this

@article{463d948ec8a84975b5c0756ae405e740,

title = "Wait-free consensus using asynchronous hardware",

abstract = "This paper studies the wait-free consensus problem in the asynchronous shared memory model. In this model, processors communicate by shared registers that allow atomic read and write operations (but do not support atomic test-and-set). It is known that the wait-free consensus problem cannot be solved by deterministic protocols. A randomized solution is presented. This protocol is simple, constructive, tolerates up to n - 1 processors crashes (where n is the number of processors), and its expected run-time is O(n2).",

author = "Benny Chor and Amos Israeli and Ming Li",

year = "1994",

doi = "10.1137/S0097539790192635",

language = "אנגלית",

volume = "23",

pages = "701--712",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "4",

}

TY - JOUR

T1 - Wait-free consensus using asynchronous hardware

AU - Chor, Benny

AU - Israeli, Amos

AU - Li, Ming

PY - 1994

Y1 - 1994

N2 - This paper studies the wait-free consensus problem in the asynchronous shared memory model. In this model, processors communicate by shared registers that allow atomic read and write operations (but do not support atomic test-and-set). It is known that the wait-free consensus problem cannot be solved by deterministic protocols. A randomized solution is presented. This protocol is simple, constructive, tolerates up to n - 1 processors crashes (where n is the number of processors), and its expected run-time is O(n2).

AB - This paper studies the wait-free consensus problem in the asynchronous shared memory model. In this model, processors communicate by shared registers that allow atomic read and write operations (but do not support atomic test-and-set). It is known that the wait-free consensus problem cannot be solved by deterministic protocols. A randomized solution is presented. This protocol is simple, constructive, tolerates up to n - 1 processors crashes (where n is the number of processors), and its expected run-time is O(n2).

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

U2 - 10.1137/S0097539790192635

DO - 10.1137/S0097539790192635

M3 - מאמר

AN - SCOPUS:0028485548

VL - 23

SP - 701

EP - 712

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 4

ER -

Wait-free consensus using asynchronous hardware

Abstract

Access to Document

Other files and links

Fingerprint

Cite this