{"date_published":"2008-01-01T00:00:00Z","extern":"1","oa_version":"None","year":"2008","volume":"5218 LNCS","language":[{"iso":"eng"}],"type":"conference","_id":"753","publist_id":"6904","citation":{"short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, in:, Springer, 2008, pp. 32–46.","mla":"Alistarh, Dan-Adrian, et al. <i>How to Solve Consensus in the Smallest Window of Synchrony</i>. Vol. 5218 LNCS, Springer, 2008, pp. 32–46, doi:<a href=\"https://doi.org/10.1007/978-3-540-87779-0_3\">10.1007/978-3-540-87779-0_3</a>.","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “How to solve consensus in the smallest window of synchrony,” presented at the DISC: Distributed Computing, 2008, vol. 5218 LNCS, pp. 32–46.","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2008. How to solve consensus in the smallest window of synchrony. DISC: Distributed Computing, LNCS, vol. 5218 LNCS, 32–46.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. How to solve consensus in the smallest window of synchrony. In: Vol 5218 LNCS. Springer; 2008:32-46. doi:<a href=\"https://doi.org/10.1007/978-3-540-87779-0_3\">10.1007/978-3-540-87779-0_3</a>","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “How to Solve Consensus in the Smallest Window of Synchrony,” 5218 LNCS:32–46. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-87779-0_3\">https://doi.org/10.1007/978-3-540-87779-0_3</a>.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., &#38; Travers, C. (2008). How to solve consensus in the smallest window of synchrony (Vol. 5218 LNCS, pp. 32–46). Presented at the DISC: Distributed Computing, Springer. <a href=\"https://doi.org/10.1007/978-3-540-87779-0_3\">https://doi.org/10.1007/978-3-540-87779-0_3</a>"},"abstract":[{"lang":"eng","text":"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."}],"author":[{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"full_name":"Guerraoui, Rachid","last_name":"Guerraoui","first_name":"Rachid"},{"last_name":"Travers","full_name":"Travers, Corentin","first_name":"Corentin"}],"date_created":"2018-12-11T11:48:19Z","conference":{"name":"DISC: Distributed Computing"},"doi":"10.1007/978-3-540-87779-0_3","status":"public","page":"32 - 46","article_processing_charge":"No","day":"01","alternative_title":["LNCS"],"publication_status":"published","date_updated":"2023-02-23T13:10:13Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","publisher":"Springer","title":"How to solve consensus in the smallest window of synchrony"}