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 -