Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the robustness of Herlihy's hierarchy
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
The State Machine Approach: A Tutorial
Proceedings of the Asilomar Workshop on Fault-Tolerant Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
On the use of registers in achieving wait-free consensus
Distributed Computing
Distributed Computing
Atomic shared register access by asynchronous hardware
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Anonymous asynchronous systems: the case of failure detectors
DISC'10 Proceedings of the 24th international conference on Distributed computing
Dynamic atomic storage without consensus
Journal of the ACM (JACM)
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Relations linking failure detectors associated with k-set agreement in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Brief announcement: on the meaning of solving a task with a failure detector
DISC'11 Proceedings of the 25th international conference on Distributed computing
Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Brief announcement: anonymity, failures, detectors and consensus
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Theoretical Computer Science
| Hi-index | 0.01 |
This article determines the weakest failure detectors to implement shared atomic objects in a distributed system with crash-prone processes. We first determine the weakest failure detector for the basic register object. We then use that to determine the weakest failure detector for all popular atomic objects including test-and-set, fetch-and-add, queue, consensus and compare-and-swap, which we show is the same.