Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
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)
ACM Transactions on Computer Systems (TOCS)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
On the hardness of failure-sensitive agreement problems
Information Processing Letters
Distributed Algorithms
The inherent price of indulgence
Proceedings of the twenty-first annual symposium on Principles of distributed computing
An Indulgent Uniform Total Order Algorithm with Optimistic Delivery
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Non-blocking atomic commit in asynchronous distributed systems with failure detectors
Distributed Computing
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
Crash-Resilient Time-Free Eventual Leadership
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Computing in the Presence of Timing Failures
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework
ISPDC '06 Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
IEEE Transactions on Computers
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
The notion of a timed register and its application to indulgent synchronization
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |
An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and scheduling failures. In particular, no process can take any irrevocable action based on the operational status, correct or failed, of other processes. This paper presents an intuitive and general characterization of indulgence. The characterization can be viewed as a simple application of Murphy's law to partial runs of a distributed algorithm, in a computing model that encompasses various communication and resilience schemes. We use our characterization to establish several results about the inherent power and limitations of indulgent algorithms.