Generating fast indulgent algorithms

DOI10.1007/S00224-012-9407-2MaRDI QIDQ693079zbMATH OpenOpenAlexFDO

Authors Dan Alistarh, Rachid Guerraoui, Corentin Travers, Seth Gilbert

Publication date 7 December 2012

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-012-9407-2

zbMATH Keywords

distributed algorithmsasynchronyindulgent algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• The inherent price of indulgence
• Indulgent algorithms (preliminary version)
• On the Message Complexity of Indulgent Consensus
• The inherent price of indulgence
• scientific article; zbMATH DE number 222692

Cites work

• Fast Paxos
• How to Solve Consensus in the Smallest Window of Synchrony
• Indulgent algorithms (preliminary version)
• Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
• Renaming in an asynchronous environment
• Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
• The Disagreement Power of an Adversary
• The inherent price of indulgence
• The inherent price of indulgence
• The overhead of consensus failure recovery
• The topological structure of asynchronous computability
• Timeliness, failure-detectors, and consensus performance
• Unreliable failure detectors for asynchronous systems (preliminary version)
• Wait-free implementations in message-passing systems

Cited in

(2)

• The inherent price of indulgence
• Indulgent algorithms (preliminary version)

This page was built for publication: Generating fast indulgent algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693079)