Brief announcement: New bounds for partially synchronous set agreement
LNCS
Alistarh, Dan-Adrian
Gilbert, Seth
Guerraoui, Rachid
Travers, Corentin
Set agreement [4] is a fundamental problem in distributed computing, in which processes collectively choose a small subset of values from a larger set of proposals. Set agreement has been extensively studied in both synchronous and asynchronous systems [10,11,3,5,8,9]. Real world distributed systems, however, are neither purely synchronous nor purely asynchronous. To describe such a system, Dwork et al. [6] introduced the idea of partial synchrony. They assume for every execution some (unknown) time GST (global stabilization time), after which the system is synchronous. In a recent paper [1,2], we study the complexity of set agreement in the context of partially synchronous systems, determining the minimum-sized window of synchrony in which set agreement can be solved. We show that at least ⌊t/k⌋ + 2 synchronous rounds are required for k-set agreement, where t < n is the number of crashes, and k is the agreement parameter of the set agreement task. We then introduce an algorithm that terminates in any window of synchrony of size at least ⌊t/k⌋ + 4 rounds. Together, these results tightly bound the inherent price of tolerating some asynchrony.
Springer
2010
info:eu-repo/semantics/conferenceObject
doc-type:conferenceObject
text
http://purl.org/coar/resource_type/c_5794
https://research-explorer.ista.ac.at/record/758
Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Brief announcement: New bounds for partially synchronous set agreement. In: Vol 6343 LNCS. Springer; 2010:404-405. doi:<a href="https://doi.org/10.1007/978-3-642-15763-9_40">10.1007/978-3-642-15763-9_40</a>
eng
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-15763-9_40
info:eu-repo/semantics/closedAccess