Atomic m-register operations

Michael Merritt; Gadi Taubenfeld

doi:10.1007/BF02280835

Atomic m-register operations

Michael Merritt, Gadi Taubenfeld

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

Abstract

We investigate systems where it is possible to access several shared registers in one atomic step. We characterize those systems in which the consensus problem can be solved in the presence of faults and give bounds on the space required. We also describe a fast solution to the mutual exclusion problem using atomic m-register operations.

Original language	English
Pages (from-to)	213-221
Number of pages	9
Journal	Distributed Computing
Volume	7
Issue number	4
DOIs	https://doi.org/10.1007/BF02280835
State	Published - May 1994
Externally published	Yes

Keywords

Agreement
Consensus
Fault-tolerance
Impossibility
Lower bounds
Mutual exclusion
Shared memory

Access to Document

10.1007/BF02280835

Cite this

@article{9f4502a328d14f33a4ef72fd5e321d54,

title = "Atomic m-register operations",

abstract = "We investigate systems where it is possible to access several shared registers in one atomic step. We characterize those systems in which the consensus problem can be solved in the presence of faults and give bounds on the space required. We also describe a fast solution to the mutual exclusion problem using atomic m-register operations.",

keywords = "Agreement, Consensus, Fault-tolerance, Impossibility, Lower bounds, Mutual exclusion, Shared memory",

author = "Michael Merritt and Gadi Taubenfeld",

year = "1994",

month = may,

doi = "10.1007/BF02280835",

language = "אנגלית",

volume = "7",

pages = "213--221",

journal = "Distributed Computing",

issn = "0178-2770",

publisher = "Springer Verlag",

number = "4",

}

TY - JOUR

T1 - Atomic m-register operations

AU - Merritt, Michael

AU - Taubenfeld, Gadi

PY - 1994/5

Y1 - 1994/5

N2 - We investigate systems where it is possible to access several shared registers in one atomic step. We characterize those systems in which the consensus problem can be solved in the presence of faults and give bounds on the space required. We also describe a fast solution to the mutual exclusion problem using atomic m-register operations.

AB - We investigate systems where it is possible to access several shared registers in one atomic step. We characterize those systems in which the consensus problem can be solved in the presence of faults and give bounds on the space required. We also describe a fast solution to the mutual exclusion problem using atomic m-register operations.

KW - Agreement

KW - Consensus

KW - Fault-tolerance

KW - Impossibility

KW - Lower bounds

KW - Mutual exclusion

KW - Shared memory

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

U2 - 10.1007/BF02280835

DO - 10.1007/BF02280835

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

AN - SCOPUS:0141775590

SN - 0178-2770

VL - 7

SP - 213

EP - 221

JO - Distributed Computing

JF - Distributed Computing

IS - 4

ER -

Atomic m-register operations

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this