{"conference":{"name":"DISC: Distributed Computing"},"date_created":"2018-12-11T11:48:21Z","title":"Brief announcement: New bounds for partially synchronous set agreement","publisher":"Springer","month":"01","date_updated":"2023-02-23T13:11:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","alternative_title":["LNCS"],"day":"01","page":"404 - 405","article_processing_charge":"No","status":"public","doi":"10.1007/978-3-642-15763-9_40","volume":"6343 LNCS","year":"2010","oa_version":"None","extern":"1","date_published":"2010-01-01T00:00:00Z","abstract":[{"text":"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 &lt; 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.","lang":"eng"}],"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"},{"full_name":"Travers, Corentin","last_name":"Travers","first_name":"Corentin"}],"publist_id":"6899","citation":{"chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Brief Announcement: New Bounds for Partially Synchronous Set Agreement,” 6343 LNCS:404–5. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_40\">https://doi.org/10.1007/978-3-642-15763-9_40</a>.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., &#38; Travers, C. (2010). Brief announcement: New bounds for partially synchronous set agreement (Vol. 6343 LNCS, pp. 404–405). Presented at the DISC: Distributed Computing, Springer. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_40\">https://doi.org/10.1007/978-3-642-15763-9_40</a>","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, in:, Springer, 2010, pp. 404–405.","mla":"Alistarh, Dan-Adrian, et al. <i>Brief Announcement: New Bounds for Partially Synchronous Set Agreement</i>. Vol. 6343 LNCS, Springer, 2010, pp. 404–05, doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_40\">10.1007/978-3-642-15763-9_40</a>.","ama":"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>","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Brief announcement: New bounds for partially synchronous set agreement,” presented at the DISC: Distributed Computing, 2010, vol. 6343 LNCS, pp. 404–405.","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2010. Brief announcement: New bounds for partially synchronous set agreement. DISC: Distributed Computing, LNCS, vol. 6343 LNCS, 404–405."},"_id":"758","type":"conference","language":[{"iso":"eng"}]}