Computing with faulty shared memory

Authors:
Yehuda Afek;David S. Greenberg;Michael Merritt;Gadi Taubenfeld
Affiliations:
Computer Science Department, Tel-Aviv University, Israel 69978 and AT&T Bell Laboratories;Sandia National Laboratories, Mail Stop 1423, P.O. Box 5800, Albuquerque, NM;AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ;AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ
Venue:
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Year:
1992

Citing 20
Cited 16

Easy impossibility proofs for distributed consensus problems

Distributed Computing
On processor coordination using asynchronous hardware

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Hierarchical correctness proofs for distributed algorithms

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The elusive atomic register revisited

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing multi-reader atomic values from non-atomic values

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A protocol for wait-free, atomic, multi-reader shared variables

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing two-writer atomic registers

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On achieving consensus using a shared memory

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots of shared memory

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
The wakeup problem

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent counting

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Cache Memories

ACM Computing Surveys (CSUR)
Concurrent Reading While Writing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
How to Construct an Atomic Variable (Extended Abstract)

Proceedings of the 3rd International Workshop on Distributed Algorithms
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Economical solutions for the critical section problem in a distributed system (Extended Abstract)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

A completeness theorem for a class of synchronization objects

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
On the use of registers in achieving wait-free consensus

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Failure detectors and the wait-free hierarchy (extended abstract)

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Computing with faulty shared objects

Journal of the ACM (JACM)
Constructing a reliable test&set bit

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The power of multi-objects (extended abstract)

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fault-tolerant wait-free shared objects

Journal of the ACM (JACM)
Constructing a Reliable Test&Set Bit

IEEE Transactions on Parallel and Distributed Systems
Post-mortem black-box correctness tests for basic parallel data structures

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Modelling Asynchrony with a Synchronous Model

Formal Methods in System Design
Formal Verification of a Distributed Computer System

Formal Methods in System Design
Self-stabilization of wait-free shared memory objects

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
On using network attached disks as shared memory

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Revisiting the impossibility for boosting service resilience

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Resilience of mutual exclusion algorithms to transient memory faults

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

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.