{"date_published":"2011-01-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:48:20Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","author":[{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Seth","full_name":"Gilbert, Seth","last_name":"Gilbert"},{"first_name":"Rachid","full_name":"Guerraoui, Rachid","last_name":"Guerraoui"},{"first_name":"Corentin","full_name":"Travers, Corentin","last_name":"Travers"}],"day":"01","article_processing_charge":"No","doi":"10.1007/978-3-642-17679-1_4","publisher":"Springer","title":"Generating fast indulgent algorithms","conference":{"name":"ICDCN: International Conference on Distributed Computing and Networking"},"_id":"757","abstract":[{"lang":"eng","text":"Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficiently transform an algorithm that relies on synchronization into an algorithm that tolerates asynchronous executions. We introduce a transformation technique from synchronous algorithms to indulgent algorithms [1], which induces only a constant overhead in terms of time complexity in well-behaved executions. Our technique is based on a new abstraction we call an asynchrony detector, which the participating processes implement collectively. The resulting transformation works for a large class of colorless tasks, including consensus and set agreement. Interestingly, we also show that our technique is relevant for colored tasks, by applying it to the renaming problem, to obtain the first indulgent renaming algorithm."}],"extern":"1","date_updated":"2023-02-23T13:11:09Z","publist_id":"6898","type":"conference","status":"public","month":"01","year":"2011","acknowledgement":"The authors would like to thank Prof. Hagit Attiya and Nikola\r\nKneˇ\r\nzevi ́\r\nc for their help on previous drafts of this paper, and the anonymous reviewers\r\nfor their useful feedback.","alternative_title":["LNCS"],"volume":"6522 LNCS","citation":{"mla":"Alistarh, Dan-Adrian, et al. <i>Generating Fast Indulgent Algorithms</i>. Vol. 6522 LNCS, Springer, 2011, pp. 41–52, doi:<a href=\"https://doi.org/10.1007/978-3-642-17679-1_4\">10.1007/978-3-642-17679-1_4</a>.","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating fast indulgent algorithms,” presented at the ICDCN: International Conference on Distributed Computing and Networking, 2011, vol. 6522 LNCS, pp. 41–52.","ista":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2011. Generating fast indulgent algorithms. ICDCN: International Conference on Distributed Computing and Networking, LNCS, vol. 6522 LNCS, 41–52.","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Generating fast indulgent algorithms. In: Vol 6522 LNCS. Springer; 2011:41-52. doi:<a href=\"https://doi.org/10.1007/978-3-642-17679-1_4\">10.1007/978-3-642-17679-1_4</a>","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., &#38; Travers, C. (2011). Generating fast indulgent algorithms (Vol. 6522 LNCS, pp. 41–52). Presented at the ICDCN: International Conference on Distributed Computing and Networking, Springer. <a href=\"https://doi.org/10.1007/978-3-642-17679-1_4\">https://doi.org/10.1007/978-3-642-17679-1_4</a>","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Generating Fast Indulgent Algorithms,” 6522 LNCS:41–52. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-17679-1_4\">https://doi.org/10.1007/978-3-642-17679-1_4</a>.","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, in:, Springer, 2011, pp. 41–52."},"page":"41 - 52","oa_version":"None"}