The overhead of consensus failure recovery

DOI10.1007/s00446-006-0017-6zbMath1266.68210OpenAlexW2090505671MaRDI QIDQ1954212

Idit Keidar, Rachid Guerraoui, Partha Sharathi Dutta

Publication date: 20 June 2013

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

Full work available at URL: https://infoscience.epfl.ch/record/90531/files/DGKfinalSub.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items

A Paxos based algorithm to minimize the overhead of process recovery in consensus, Using asynchrony and zero degradation to speed up indulgent consensus protocols, How to Solve Consensus in the Smallest Window of Synchrony, Generating fast indulgent algorithms

Cites Work

• A lower bound for the time to assure interactive consistency
• A simple proof of the uniform consensus synchronous lower bound.
• The inherent price of indulgence
• Round-by-round fault detectors (extended abstract)
• Early stopping in Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• The Byzantine Generals Problem
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for reliable distributed systems
• Uniform consensus is harder than consensus