Computing with faulty shared memory

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery (ACM)
Pages47-58
Number of pages12
ISBN (Print)0897914953, 9780897914956
DOIs
StatePublished - 1992
EventProceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing - Vancouver, BC, Can
Duration: 10 Aug 199212 Aug 1992

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

ConferenceProceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing
CityVancouver, BC, Can
Period10/08/9212/08/92

Fingerprint

Dive into the research topics of 'Computing with faulty shared memory'. Together they form a unique fingerprint.

Cite this