The inherent price of indulgence

DOI10.1007/S00446-005-0124-9zbMath1264.68085OpenAlexW2707263665MaRDI QIDQ1953640

Partha Sharathi Dutta, Rachid Guerraoui

Publication date: 7 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/52452/files/IC_TECH_REPORT_200231.pdf

zbMATH Keywords

fault tolerancedistributed algorithmsconsensus time complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (5)

Of choices, failures and asynchrony: the many faces of set agreement ⋮ The overhead of consensus failure recovery ⋮ How to Solve Consensus in the Smallest Window of Synchrony ⋮ Generating fast indulgent algorithms ⋮ A topological treatment of early-deciding set-agreement

Cites Work

• Unnamed Item
• A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
• A simple proof of the uniform consensus synchronous lower bound.
• Round-by-round fault detectors (extended abstract)
• Impossibility of distributed consensus with one faulty process
• The Byzantine Generals Problem
• Unreliable failure detectors for reliable distributed systems
• Uniform consensus is harder than consensus
• Indulgent algorithms (preliminary version)
• Distributed Computing

This page was built for publication: The inherent price of indulgence