On achieving consensus using a shared memory
Karl Abrahamson · 1988
Chor, Israeli and Li recently published three randomized algorithms for a version of the consensus problem for a shared memory model of distributed computing.Their model requires, as atomic instructions on the shared memory, reads and random writes (in which a random choice and a write are done together in a single atomic instruction).This paper develops randomized algorithms for a model in which the only atomic operations on the shared memory are reads and writes.