How to Solve Consensus in the Smallest Window of Synchrony

DOI10.1007/978-3-540-87779-0_3MaRDI QIDQ3540219zbMATH OpenOpenAlexFDO

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

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87779-0_3

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Lower bounds for asynchronous consensus
• Synchronous condition-based consensus
• Minimal synchrony for Byzantine consensus
• Communication-efficient leader election and consensus with limited link synchrony
• The weakest failure detector for solving consensus

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Early stopping in Byzantine agreement
• Fast Paxos
• Impossibility of distributed consensus with one faulty process
• Indulgent algorithms (preliminary version)
• Knowledge and common knowledge in a distributed environment
• Lower bounds for asynchronous consensus
• Reaching Agreement in the Presence of Faults
• Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
• The Byzantine Generals Problem
• The inherent price of indulgence
• The inherent price of indulgence
• The overhead of consensus failure recovery
• The weakest failure detector for solving consensus
• Timeliness, failure-detectors, and consensus performance
• Unreliable failure detectors for reliable distributed systems

Cited in

(6)

• Making Byzantine consensus live
• Making Byzantine consensus live
• Generating fast indulgent algorithms
• You only live multiple times: a blackbox solution for reusing crash-stop algorithms in realistic crash-recovery settings
• A Paxos based algorithm to minimize the overhead of process recovery in consensus
• Of choices, failures and asynchrony: the many faces of set agreement

Describes a project that uses

Uses Software

• ASAP

This page was built for publication: How to Solve Consensus in the Smallest Window of Synchrony

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