Wait-free consensus using asynchronous hardware

Benny Chor*, Amos Israeli, Ming Li

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-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(n2).

Original languageEnglish
Pages (from-to)701-712
Number of pages12
JournalSIAM Journal on Computing
Volume23
Issue number4
DOIs
StatePublished - 1994
Externally publishedYes

Fingerprint

Dive into the research topics of 'Wait-free consensus using asynchronous hardware'. Together they form a unique fingerprint.

Cite this