Alistarh, DanGilbert, SethGuerraoui, RachidTravers, Corentin2008-08-082008-08-082008-08-08200810.1007/978-3-540-87779-0_3https://infoscience.epfl.ch/handle/20.500.14299/27283WOS:000260421000003This 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.distributed computingconsensuseventual synchronyoptimally resilienttext::conference output::conference proceedings::conference paper