On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Extended impossibility results for asynchronous complete networks
Information Processing Letters
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
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)
Failure detectors in omission failure environments
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Information Processing Letters
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
On Quiescent Reliable Communication
SIAM Journal on Computing
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Dictatorial Transaction Processing: Atomic Commitment Without Veto Right
Distributed and Parallel Databases
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Stability of long-lived consensus
Journal of Computer and System Sciences
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
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
Research note: From ♢W to Ω: A simple bounded quiescent reliable broadcast-based transformation
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Unreliable failure detectors are abstract devices that, when added to asynchronous distributed systems, enable solving distributed computing problems (e.g., Consensus) that otherwise would be impossible to solve in these systems. This paper focuses on two classes of failure detectors defined by Chandra and Toueg, namely, the classes denoted ◊P (eventually perfect) and ◊S (eventually strong). Both classes include failure detectors that eventually detect permanently all process crashes, but while the failure detectors of ◊P eventually make no erroneous suspicions, the failure detectors of ◊S are only required to eventually not suspect a single correct process. Informally, in a one-shot agreement problem, a new problem instance is created each time the processes propose new values to be decided on (e.g., Consensus is one-shot). In such a context, this paper addresses the following question related to the comparative power of these classes, namely: "Are there one-shot agreement problems that can be solved in asynchronous distributed systems with reliable links but prone to process crash failures augmented with ◊P, but cannot be solved when those systems are augmented with ◊S ?” Surprisingly, the paper shows that the answer to this question is "no.” An important consequence of this result is that ◊P cannot be the weakest class of failure detectors that enables solving one-shot agreement problems in unreliable asynchronous distributed systems.