Simple CHT: A new derivation of the weakest failure detector for consensus (original) (raw)
Related papers
N-Consensus is the Second Strongest Object for N + 1 Processes
Lecture Notes in Computer Science, 2007
Implementing the weakest failure detector for solving the consensus problem
International Journal of Parallel, Emergent and Distributed Systems, 2013
Distributed Consensus, revisited
Acta Informatica, 2007
The weakest failure detector for solving consensus
1992
Initial failures in distributed computations
International Journal of Parallel Programming, 1989
Synchronous consensus for dependent process failures
23rd International Conference on Distributed Computing Systems, 2003. Proceedings., 2003
Consensus based on failure detectors with a perpetual accuracy property
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000
Optimal Implementation of the Weakest Failure Detector for Solving Consensus
2000
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit
SIAM Journal on Computing, 2012
Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus
2011
Implementing the Weakest Failure Detector for Solving Consensus
One-Step Consensus Solvability
Lecture Notes in Computer Science, 2006
Communication-efficient and crash-quiescent Omega with unknown membership
Information Processing Letters, 2011
A Wealth of Sub-Consensus Deterministic Objects
2018
Journal of Computer and System Sciences, 2019
Evaluating the condition-based approach to solve consensus
2003 International Conference on Dependable Systems and Networks, 2003. Proceedings., 2003
The consensus problem in fault-tolerant computing
ACM Computing Surveys, 1993
Distributed Computing, 2011
Good, Better, Best!-Unbeatable Protocols for Consensus and Set Consensus
Set Consensus: Captured by a Set of Runs with Ramifications
arXiv (Cornell University), 2014
Impossibility Results in the Presence of Multiple Faulty Processes
Information and Computation, 1994
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
IEEE Transactions on Dependable and Secure Computing, 2000
Byzantine Consensus In Asynchronous Message-Passing Systems: a Survey
Algorithms
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences, 2008
On the cost of fault-tolerant consensus when there are no faults
ACM SIGACT News, 2001
Consensus in anonymous asynchronous systems with crash-recovery and omission failures
Computing, 2021
Wait-Free Universality of Consensus in the Infinite Arrival Model
2019
Verifying Fault-Tolerant Distributed Algorithms in the Heard-Of Model
2012
On the weakest failure detector ever
Distributed Computing, 2009
Modeling Consensus in a Process Calculus
Lecture Notes in Computer Science, 2003
Structured derivations of consensus algorithms for failure detectors
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98, 1998
With Finite Memory Consensus Is Easier Than Reliable Broadcast
Lecture Notes in Computer Science, 2008
Consensus in One Communication Step
Lecture Notes in Computer Science, 2001
The unified structure of consensus
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98, 1998
Concurrent systems and inevitability
Wojciech Penczek, Antoni Mazurkiewicz
Theoretical Computer Science, 1989