Please use this identifier to cite or link to this item:
|Title:||Generating Fast Indulgent Algorithms||Authors:||Alistarh, D.
|Issue Date:||2012||Citation:||Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C. (2012). Generating Fast Indulgent Algorithms. Theory of Computing Systems 51 (4) : 404-424. ScholarBank@NUS Repository. https://doi.org/10.1007/s00224-012-9407-2||Abstract:||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 synchronous timing into an algorithm that tolerates asynchronous executions. We introduce a transformation technique from synchronous algorithms to indulgent algorithms (Guerraoui, in PODC, pp. 289-297, 2000), 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 the class of colorless distributed 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. © 2012 Springer Science+Business Media, LLC.||Source Title:||Theory of Computing Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/39153||ISSN:||14324350||DOI:||10.1007/s00224-012-9407-2|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.