Generating Fast Indulgent Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theory of Computing Systems Year : 2012

Generating Fast Indulgent Algorithms


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 seta 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.
Fichier principal
Vignette du fichier
detectors.pdf (169.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00992775 , version 1 (19-05-2014)


  • HAL Id : hal-00992775 , version 1


Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers. Generating Fast Indulgent Algorithms. Theory of Computing Systems, 2012, 51 (4), pp.404-424. ⟨hal-00992775⟩


212 View
101 Download


Gmail Facebook X LinkedIn More