How to solve consensus in the smallest window of synchrony

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.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published | English
Author
Alistarh, Dan-AdrianIST Austria; Gilbert, Seth; Guerraoui, Rachid; Travers, Corentin
Series Title
LNCS
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.
Publishing Year
Date Published
2008-01-01
Volume
5218 LNCS
Page
32 - 46
Conference
DISC: Distributed Computing
IST-REx-ID
753

Cite this

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:10.1007/978-3-540-87779-0_3
Alistarh, D.-A., Gilbert, S., Guerraoui, R., & 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. https://doi.org/10.1007/978-3-540-87779-0_3
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. https://doi.org/10.1007/978-3-540-87779-0_3.
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.
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.
Alistarh, Dan-Adrian, et al. How to Solve Consensus in the Smallest Window of Synchrony. Vol. 5218 LNCS, Springer, 2008, pp. 32–46, doi:10.1007/978-3-540-87779-0_3.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar