Computing with faulty shared memory

Yehuda Afek; David S. Greenberg; Michael Merritt; Gadi Taubenfeld

doi:10.1145/135419.135431

Computing with faulty shared memory

Yehuda Afek
, David S. Greenberg
, Michael Merritt
, Gadi Taubenfeld

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

Abstract

This paper addresses problems which arise in the synchronization and coordination of distributed systems which employ unreliable shared memory. We present algorithms which solve the consensus problem, and which simulate reliable shared-memory objects, despite the fact that the available memory objects (e.g. read/write registers, test-and-set registers, read-modify-write registers) may be faulty.

Original language	English
Title of host publication	PODC 1992
Subtitle of host publication	Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Publisher	Publ by ACM
Pages	47-58
Number of pages	12
ISBN (Print)	0897914953, 9780897914956
DOIs	https://doi.org/10.1145/135419.135431
State	Published - 1 Oct 1992
Externally published	Yes
Event	11th Annual ACM Symposium on Principles of Distributed Computing, PODC 1992 - Vancouver, BC, Can, Canada Duration: 10 Aug 1992 → 12 Aug 1992

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	11th Annual ACM Symposium on Principles of Distributed Computing, PODC 1992
Country/Territory	Canada
City	Vancouver, BC, Can
Period	10/08/92 → 12/08/92

Access to Document

10.1145/135419.135431

Cite this

@inproceedings{ac626f3f9a074d26879e038e92ff6265,

title = "Computing with faulty shared memory",

abstract = "This paper addresses problems which arise in the synchronization and coordination of distributed systems which employ unreliable shared memory. We present algorithms which solve the consensus problem, and which simulate reliable shared-memory objects, despite the fact that the available memory objects (e.g. read/write registers, test-and-set registers, read-modify-write registers) may be faulty.",

author = "Yehuda Afek and Greenberg, \{David S.\} and Michael Merritt and Gadi Taubenfeld",

year = "1992",

month = oct,

day = "1",

doi = "10.1145/135419.135431",

language = "אנגלית",

isbn = "0897914953",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Publ by ACM",

pages = "47--58",

booktitle = "PODC 1992",

note = "11th Annual ACM Symposium on Principles of Distributed Computing, PODC 1992 ; Conference date: 10-08-1992 Through 12-08-1992",

}

Afek, Y, Greenberg, DS, Merritt, M & Taubenfeld, G 1992, Computing with faulty shared memory. in PODC 1992: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Publ by ACM, pp. 47-58, 11th Annual ACM Symposium on Principles of Distributed Computing, PODC 1992, Vancouver, BC, Can, Canada, 10/08/92. https://doi.org/10.1145/135419.135431

Computing with faulty shared memory. / Afek, Yehuda; Greenberg, David S.; Merritt, Michael et al.
PODC 1992: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing. Publ by ACM, 1992. p. 47-58 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

TY - GEN

T1 - Computing with faulty shared memory

AU - Afek, Yehuda

AU - Greenberg, David S.

AU - Merritt, Michael

AU - Taubenfeld, Gadi

PY - 1992/10/1

Y1 - 1992/10/1

N2 - This paper addresses problems which arise in the synchronization and coordination of distributed systems which employ unreliable shared memory. We present algorithms which solve the consensus problem, and which simulate reliable shared-memory objects, despite the fact that the available memory objects (e.g. read/write registers, test-and-set registers, read-modify-write registers) may be faulty.

AB - This paper addresses problems which arise in the synchronization and coordination of distributed systems which employ unreliable shared memory. We present algorithms which solve the consensus problem, and which simulate reliable shared-memory objects, despite the fact that the available memory objects (e.g. read/write registers, test-and-set registers, read-modify-write registers) may be faulty.

UR - https://www.scopus.com/pages/publications/0026991178

U2 - 10.1145/135419.135431

DO - 10.1145/135419.135431

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

AN - SCOPUS:0026991178

SN - 0897914953

SN - 9780897914956

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 47

EP - 58

BT - PODC 1992

PB - Publ by ACM

T2 - 11th Annual ACM Symposium on Principles of Distributed Computing, PODC 1992

Y2 - 10 August 1992 through 12 August 1992

ER -

Computing with faulty shared memory

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this