Indulgent algorithms (preliminary version)
From MaRDI portal
Publication:5176790
DOI10.1145/343477.343630zbMath1314.68378WikidataQ60019985 ScholiaQ60019985MaRDI QIDQ5176790
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
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Related Items
X-Ability: a theory of replication, What Can be Computed in a Distributed System?, 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, Generating fast indulgent algorithms, Anti-\(\Omega \): the weakest failure detector for set agreement, Refined quorum systems, A simple proof of the uniform consensus synchronous lower bound., The inherent price of indulgence, Efficient adaptive collect using randomization, The weakest failure detectors to boost obstruction-freedom, Contention-related crash failures: definitions, agreement algorithms, and impossibility results, How to Solve Consensus in the Smallest Window of Synchrony, The Weakest Failure Detector for Message Passing Set-Agreement
