Space-efficient asynchronous consensus without shared memory initialization

Michael J. Fischer; Shlomo Moran; Gadi Taubenfeld

doi:10.1016/0020-0190(93)90223-V

Space-efficient asynchronous consensus without shared memory initialization

Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld

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

Abstract

We study the consensus problem in a shared memory model where all processes are programmed alike, there is no global synchronization, it is not possible to simultaneously reset all parts of the system to a known initial state, and processes may be faulty. We present a consensus protocol for n processes which can tolerate up to ⌈n/2⌉ - 1 failures and which uses a single (2⌈1.5n-1⌉)-valued shared register.

Original language	English
Pages (from-to)	101-105
Number of pages	5
Journal	Information Processing Letters
Volume	45
Issue number	2
DOIs	https://doi.org/10.1016/0020-0190(93)90223-V
State	Published - 26 Feb 1993
Externally published	Yes

Bibliographical note

Funding Information:
Correspondence to: G. Taubenfeld, AT&T Bell Laboratories, 28-408, 600 Mountain Avenue, Murray Hill, NJ 07974, USA. * This work was supported in part by ONR contract NOO014-89-J-1980, by the National Science Foundation under grants CCR-8405478 and IRI-9015570, by the Hebrew Technical Institute scholarship, by the Technion V.P.R. Funds - Wellner Research Fund, and by the Foundation for Re-search in Electronics, Computers and Communications, administered by the Israel Academy of Sciences and Hu-manities.

Keywords

Fault tolerance
crash failures
initialization failures
shared memory

Access to Document

10.1016/0020-0190(93)90223-V

Cite this

@article{aadec4755fc84015ae5da2f1fd2b5071,

title = "Space-efficient asynchronous consensus without shared memory initialization",

abstract = "We study the consensus problem in a shared memory model where all processes are programmed alike, there is no global synchronization, it is not possible to simultaneously reset all parts of the system to a known initial state, and processes may be faulty. We present a consensus protocol for n processes which can tolerate up to ⌈n/2⌉ - 1 failures and which uses a single (2⌈1.5n-1⌉)-valued shared register.",

keywords = "Fault tolerance, crash failures, initialization failures, shared memory",

author = "Fischer, {Michael J.} and Shlomo Moran and Gadi Taubenfeld",

note = "Funding Information: Correspondence to: G. Taubenfeld, AT&T Bell Laboratories, 28-408, 600 Mountain Avenue, Murray Hill, NJ 07974, USA. * This work was supported in part by ONR contract NOO014-89-J-1980, by the National Science Foundation under grants CCR-8405478 and IRI-9015570, by the Hebrew Technical Institute scholarship, by the Technion V.P.R. Funds - Wellner Research Fund, and by the Foundation for Re-search in Electronics, Computers and Communications, administered by the Israel Academy of Sciences and Hu-manities.",

year = "1993",

month = feb,

day = "26",

doi = "10.1016/0020-0190(93)90223-V",

language = "אנגלית",

volume = "45",

pages = "101--105",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Space-efficient asynchronous consensus without shared memory initialization

AU - Fischer, Michael J.

AU - Moran, Shlomo

AU - Taubenfeld, Gadi

N1 - Funding Information: Correspondence to: G. Taubenfeld, AT&T Bell Laboratories, 28-408, 600 Mountain Avenue, Murray Hill, NJ 07974, USA. * This work was supported in part by ONR contract NOO014-89-J-1980, by the National Science Foundation under grants CCR-8405478 and IRI-9015570, by the Hebrew Technical Institute scholarship, by the Technion V.P.R. Funds - Wellner Research Fund, and by the Foundation for Re-search in Electronics, Computers and Communications, administered by the Israel Academy of Sciences and Hu-manities.

PY - 1993/2/26

Y1 - 1993/2/26

N2 - We study the consensus problem in a shared memory model where all processes are programmed alike, there is no global synchronization, it is not possible to simultaneously reset all parts of the system to a known initial state, and processes may be faulty. We present a consensus protocol for n processes which can tolerate up to ⌈n/2⌉ - 1 failures and which uses a single (2⌈1.5n-1⌉)-valued shared register.

AB - We study the consensus problem in a shared memory model where all processes are programmed alike, there is no global synchronization, it is not possible to simultaneously reset all parts of the system to a known initial state, and processes may be faulty. We present a consensus protocol for n processes which can tolerate up to ⌈n/2⌉ - 1 failures and which uses a single (2⌈1.5n-1⌉)-valued shared register.

KW - Fault tolerance

KW - crash failures

KW - initialization failures

KW - shared memory

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

U2 - 10.1016/0020-0190(93)90223-V

DO - 10.1016/0020-0190(93)90223-V

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0027543649

SN - 0020-0190

VL - 45

SP - 101

EP - 105

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

Space-efficient asynchronous consensus without shared memory initialization

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this