Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-17679-1_4
Title: Generating fast indulgent algorithms
Authors: Alistarh, D.
Gilbert, S. 
Guerraoui, R.
Travers, C.
Issue Date: 2011
Source: Alistarh, D.,Gilbert, S.,Guerraoui, R.,Travers, C. (2011). Generating fast indulgent algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6522 LNCS : 41-52. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-17679-1_4
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 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. © 2011 Springer-Verlag Berlin Heidelberg.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/40531
ISBN: 364217678X
ISSN: 03029743
DOI: 10.1007/978-3-642-17679-1_4
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Dec 13, 2017

Page view(s)

42
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.