Indulgent algorithms (preliminary version)

DOI10.1145/343477.343630zbMath1314.68378OpenAlexW2160139557WikidataQ60019985 ScholiaQ60019985MaRDI QIDQ5176790

Rachid Guerraoui

Publication date: 3 March 2015

Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/343477.343630

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (16)

Reaching agreement in the presence of contention-related crash failures ⋮ Reaching consensus in the presence of contention-related crash failures ⋮ Self-stabilizing indulgent zero-degrading binary consensus ⋮ Using asynchrony and zero degradation to speed up indulgent consensus protocols ⋮ The inherent price of indulgence ⋮ Efficient adaptive collect using randomization ⋮ The weakest failure detectors to boost obstruction-freedom ⋮ How to Solve Consensus in the Smallest Window of Synchrony ⋮ The Weakest Failure Detector for Message Passing Set-Agreement ⋮ X-Ability: a theory of replication ⋮ Generating fast indulgent algorithms ⋮ What Can be Computed in a Distributed System? ⋮ Anti-\(\Omega \): the weakest failure detector for set agreement ⋮ Refined quorum systems ⋮ Contention-related crash failures: definitions, agreement algorithms, and impossibility results ⋮ A simple proof of the uniform consensus synchronous lower bound.

This page was built for publication: Indulgent algorithms (preliminary version)