Generating fast indulgent algorithms

DOI10.1007/S00224-012-9407-2zbMATH Open1253.68353OpenAlexW1972800575MaRDI QIDQ693079FDOQ693079

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

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

zbMATH Keywords

distributed algorithmsasynchronyindulgent algorithms

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• 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)