Work

On achieving consensus using a shared memory

Year: 1988

Type: conference-paper

Abstract: 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.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/62546.62594

Author: Karl Abrahamson

Institution: Washington State University

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2005317574

FWCI: 5.429

Cites: 13

Cited by: 131

Related to: 10