Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
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)
Replication management using the state-machine approach
Distributed systems (2nd Ed.)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Simulating Crash Failures with Many Faulty Processors (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Revisiting the Paxos Algorithm
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Decomposing Properties into Safety and Liveness
Decomposing Properties into Safety and Liveness
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Election Vs. Consensus in Asynchronous Systems
Election Vs. Consensus in Asynchronous Systems
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
The inherent price of indulgence
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
IEEE Transactions on Computers
ACM SIGACT News
A simple proof of the uniform consensus synchronous lower bound
Information Processing Letters
Fast Indulgent Consensus with Zero Degradation
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
An Efficient Universal Construction for Message-Passing Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A Generic Framework for Indulgent Consensus
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Non-blocking atomic commit in asynchronous distributed systems with failure detectors
Distributed Computing
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
The combined power of conditions and failure detectors to solve asynchronous set agreement
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Toward a theory of transactional contention managers
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The inherent price of indulgence
Distributed Computing - Special issue: PODC 02
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership
IEEE Transactions on Parallel and Distributed Systems
Efficient adaptive collect using randomization
Distributed Computing - Special issue: DISC 04
The notion of a timed register and its application to indulgent synchronization
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
The election problem in asynchronous distributed systems with bounded faulty processes
The Journal of Supercomputing
From an intermittent rotating star to a leader
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Using asynchrony and zero degradation to speed up indulgent consensus protocols
Journal of Parallel and Distributed Computing
Jgroup-ARM: a distributed object group platform with autonomous replication management
Software—Practice & Experience
Anti-Ω: the weakest failure detector for set agreement
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Local Terminations and Distributed Computability in Anonymous Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Local Maps: New Insights into Mobile Agent Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A general characterization of indulgence
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Asynchronous Byzantine consensus with 2f+1 processes
Proceedings of the 2010 ACM Symposium on Applied Computing
From an intermittent rotating star to a leader
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
Dissecting distributed computations
Future directions in distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
(anti-Ωx × Σz)-based k-set agreement algorithms
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Generating fast indulgent algorithms
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Revisiting the election problem in asynchronous distributed systems
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Solving election problem in asynchronous distributed systems
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
The election problem in asynchronous distributed systems with bounded faulty processes
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
On the message complexity of indulgent consensus
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
| Hi-index | 0.01 |
Informally, an indulgent algorithm is a distributed algorithm that tolerates unreliable failure detection: the algorithm is indulgent towards its failure detector. This paper formally characterises such algorithms and states some of their interesting features. We show that indulgent algorithms are inherently safe and uniform. We also state impossibility results for indulgent solutions to divergent problems like consensus, and failure-sensitive problems like non-blocking atomic commit and terminating reliable broadcast.