Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
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)
From binary consensus to multivalued consensus in asynchronous message-passing systems
Information Processing Letters
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
On the Relationship Between the Atomic Commitment and Consensus Problems
Proceedings of the Asilomar Workshop on Fault-Tolerant Distributed Computing
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Failure Detection Lower Bounds on Registers and Consensus
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
On the Weakest Failure Detector for Non-Blocking Atomic Commit
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
On Classes of Problems in Asynchronous Distributed Systems with Process Crashes
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Non-blocking atomic commit in asynchronous distributed systems with failure detectors
Distributed Computing
Distributed Computing
Construction of a fault-tolerant wireless communication topology using distributed agreement
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
Asynchronous bounded lifetime failure detectors
Information Processing Letters
Research note: From ♢W to Ω: A simple bounded quiescent reliable broadcast-based transformation
Journal of Parallel and Distributed Computing
Managed Agreement: Generalizing two fundamental distributed agreement problems
Information Processing Letters
On the Respective Power of ◊P and ◊S to Solve One-Shot Agreement Problems
IEEE Transactions on Parallel and Distributed Systems
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Partition approach to failure detectors for k-set agreement
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Every problem has a weakest failure detector
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
Agreement and consistency without knowing the number of processes
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Agreement without knowing everybody: a first step to dynamicity
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
With Finite Memory Consensus Is Easier Than Reliable Broadcast
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Dynamic atomic storage without consensus
Proceedings of the 28th ACM symposium on Principles of distributed computing
Extracting quorum failure detectors
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: weakest failure detectors via an egg-laying simulation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Information Processing Letters
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Asynchronous bounded lifetime failure detectors
Information Processing Letters
On the existence of weakest failure detectors for mutual exclusion and k-exclusion
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
The failure detector abstraction
ACM Computing Surveys (CSUR)
Anonymous asynchronous systems: the case of failure detectors
DISC'10 Proceedings of the 24th international conference on Distributed computing
Failure detectors encapsulate fairness
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Building and using quorums despite any number of process of crashes
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Efficient reduction for wait-free termination detection in a crash-prone distributed system
DISC'05 Proceedings of the 19th international conference on Distributed Computing
(Almost) all objects are universal in message passing systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Asynchronous failure detectors
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Weakening failure detectors for k-set agreement via the partition approach
DISC'07 Proceedings of the 21st international conference on Distributed Computing
From crash-stop to permanent omission: automatic transformation and weakest failure detectors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Automatic classification of eventual failure detectors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Quorum-based mutual exclusion in asynchronous distributed systems with unreliable failure detectors
The Journal of Supercomputing
| Hi-index | 0.00 |
We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments -- i.e., regardless of the number and timing of crashes. The problems that we consider are: implementing an atomic register, solving consensus, solving quittable consensus (a variant of consensus in which processes have the option to decide 'quit' if a failure occurs), and solving non-blocking atomic commit.