Computing with faulty shared memory
Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld · 1992
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.