Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Renaming in an asynchronous environment
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
The BG distributed simulation algorithm
Distributed Computing
Multi-writer composite registers
Distributed Computing
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The 0---1-Exclusion Families of Tasks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
The extended BG-simulation and the characterization of t-resiliency
Proceedings of the forty-first annual ACM symposium on Theory of computing
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Designing algorithms for dependent process failures
Future directions in distributed computing
The disagreement power of an adversary
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Help when needed, but no more: efficient read/write partial snapshot
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On asymmetric progress conditions
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The topology of shared-memory adversaries
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Communication and Agreement Abstractions for Fault-tolerant Asynchronous Distributed Systems
Communication and Agreement Abstractions for Fault-tolerant Asynchronous Distributed Systems
The computational structure of progress conditions
DISC'10 Proceedings of the 24th international conference on Distributed computing
Recursion in distributed computing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Turning adversaries into friends: simplified, made constructive, and extended
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
The renaming problem in shared memory systems: An introduction
Computer Science Review
From unreliable objects to reliable objects: the case of atomic registers and consensus
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Hi-index | 0.00 |
Due to the advent of multicore machines, shared memory distributed computing models taking into account asynchrony and process crashes are becoming more and more important. This paper visits models for these systems and analyses their properties from a computability point of view. Among them, the base snapshot model and the iterated model are particularly investigated. The paper visits also several approaches that have been proposed to model failures (mainly the wait-free model and the adversary model) and gives also a look at the BG simulation. The aim of this survey is to help the reader to better understand the power and limits of distributed computing shared memory models.