Generating Fast Indulgent Algorithms Journal Article

Author(s): Alistarh, Dan; Gilbert, Seth; Guerraoui, Rachid; Travers, Corentin
Article Title: Generating Fast Indulgent Algorithms
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.
Keywords: Asynchrony; Distributed algorithms; Indulgent algorithms
Journal Title: Theory of Computing Systems
Volume: 51
Issue 4
ISSN: 1433-0490
Publisher: Elsevier  
Date Published: 2012-01-01
Start Page: 404
End Page: 424
Sponsor: Dan Alistarh was supported by the NCCR MICS Project. Corentin Travers had additional support from INRIA team REGAL and ANR project SPREADS.
DOI: 10.1007/s00224-012-9407-2
Notes: The authors would like to thank Hagit Attiya and Nikola Kneževi ́ c for their feed- back on previous drafts of this paper, and the anonymous reviewers for their useful comments.
Open access: no
IST Austria Authors
Related IST Austria Work