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)
Failure detectors and the wait-free hierarchy (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the use of registers in achieving wait-free consensus
Distributed Computing
The Impossibility of Boosting Distributed Service Resilience
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Irreducibility and additivity of set agreement-oriented failure detector classes
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Agreement and consistency without knowing the number of processes
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Local Maps: New Insights into Mobile Agent Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
| Hi-index | 0.00 |
This paper shows that all shared atomic object types that can solve consensus among k 1 processes have the same weakest failure detector in a message passing system with process crash failures. In such a system, object types such as test-and-set, fetch-and-add, and queue, known to have weak synchronization power in a shared memory system are thus, in a precise sense, equivalent to universal types like compare-and-swap, known to have the strongest synchronization power. In the particular case of a message passing system of two processes, we show that, interestingly, even a register is in that sense universal.