Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
How to Solve Consensus in the Smallest Window of Synchrony
verfasst von : Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers
Erschienen in: Distributed Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper addresses the following question: what is the minimum-sized synchronous window needed to solve consensus in an otherwise asynchronous system? In answer to this question, we present the first optimally-resilient algorithm
ASAP
that solves consensus
as soon as possible
in an eventually synchronous system, i.e., a system that from some time
GST
onwards, delivers messages in a timely fashion.
ASAP
guarantees that, in an execution with at most
f
failures, every process decides no later than round
GST
+
f
+ 2, which is optimal.