Abstract
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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Alistarh, D., Gilbert, S., Guerraoui, R., & Travers, C. (2008). How to solve consensus in the smallest window of synchrony. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5218 LNCS, pp. 32–46). https://doi.org/10.1007/978-3-540-87779-0_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
