Generating fast indulgent algorithms

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.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published | English
Author
Alistarh, Dan-AdrianIST Austria; Gilbert, Seth; Guerraoui, Rachid; Travers, Corentin
Series Title
LNCS
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.
Publishing Year
Date Published
2011-01-01
Acknowledgement
The authors would like to thank Prof. Hagit Attiya and Nikola Kneˇ zevi ́ c for their help on previous drafts of this paper, and the anonymous reviewers for their useful feedback.
Volume
6522 LNCS
Page
41 - 52
Conference
ICDCN: International Conference on Distributed Computing and Networking
IST-REx-ID
757

Cite this

Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Generating fast indulgent algorithms. In: Vol 6522 LNCS. Springer; 2011:41-52. doi:10.1007/978-3-642-17679-1_4
Alistarh, D.-A., Gilbert, S., Guerraoui, R., & 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. https://doi.org/10.1007/978-3-642-17679-1_4
Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers. “Generating Fast Indulgent Algorithms,” 6522 LNCS:41–52. Springer, 2011. https://doi.org/10.1007/978-3-642-17679-1_4.
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.
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.
Alistarh, Dan-Adrian, et al. Generating Fast Indulgent Algorithms. Vol. 6522 LNCS, Springer, 2011, pp. 41–52, doi:10.1007/978-3-642-17679-1_4.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar