Part of the book series:Lecture Notes in Computer Science ((LNTCS,volume 6343))
Included in the following conference series:
1154Accesses
Abstract
Introduction. A core abstraction for many distributed algorithms simulates shared memory [3]; this abstraction allows to take algorithms designed for shared memory, and port them to asynchronous message-passing systems, even in the presence of failures. There has been significant work on creating such simulations, under various types of permanent failures, as well as on exploiting this abstraction in order to derive algorithms for message-passing systems (see [2].)
More details can be found in [1]. Noga Alon is supported in part by an ERC advanced grant, by a USA-Israeli BSF grant, by the Israel Science Foundation. Hagit Attiya is supported in part by theIsrael Science Foundation (grant number 953/06). The work started while Shlomi Dolev was a visiting professor at LIP6 supported in part by the ICT Programme of the European Union under contract number FP7-215270 (FRONTS), Microsoft, Deutsche Telekom, US Air-Force and Rita Altura Trust Chair in Computer Sciences.
This is a preview of subscription content,log in via an institution to check access.
Access this chapter
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
- Chapter
- JPY 3498
- Price includes VAT (Japan)
- eBook
- JPY 5719
- Price includes VAT (Japan)
- Softcover Book
- JPY 7149
- Price includes VAT (Japan)
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Alon, N., Attiya, H., Dolev, S., Dubois, S., Gradinariu, M., Tixeuil, S.: Practically Stabilizing Atomic Memory, arXiv 1007.1802 (2010)
Attiya, H.: Robust Simulation of Shared Memory: 20 Years After. EATCS Distributed Computing Column (2010)
Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message-Passing Systems. J. ACM 42(1), 124–142 (1995)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Dolev, D., Shavit, N.: Bounded Concurrent timestamping. SIAM J. on Computing 26(2), 418–455 (1997)
Israeli, A., Li, M.: Bonded timestamps. Distr. Comp. 6(4), 205–209 (1993)
Author information
Authors and Affiliations
Sackler School of Mathematics and Blavatnik School of Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, 69978, Israel
Noga Alon
Department of Computer Science, Technion, 32000, Israel
Hagit Attiya
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel
Shlomi Dolev
LIP6, Universite Pierre et Marie Curie, Paris 6/INRIA, 7606, France
Swan Dubois, Maria Gradinariu & Sébastien Tixeuil
- Noga Alon
You can also search for this author inPubMed Google Scholar
- Hagit Attiya
You can also search for this author inPubMed Google Scholar
- Shlomi Dolev
You can also search for this author inPubMed Google Scholar
- Swan Dubois
You can also search for this author inPubMed Google Scholar
- Maria Gradinariu
You can also search for this author inPubMed Google Scholar
- Sébastien Tixeuil
You can also search for this author inPubMed Google Scholar
Editor information
Editors and Affiliations
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, 02139-4307, Cambridge, MA, USA
Nancy A. Lynch
Computer Science and Engineering, University of Connecticut, 371 Fairfield Way, Unit 2155, 06269, Storrs, CT, USA
Alexander A. Shvartsman
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alon, N., Attiya, H., Dolev, S., Dubois, S., Gradinariu, M., Tixeuil, S. (2010). Brief Announcement: Sharing Memory in a Self-stabilizing Manner. In: Lynch, N.A., Shvartsman, A.A. (eds) Distributed Computing. DISC 2010. Lecture Notes in Computer Science, vol 6343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15763-9_49
Download citation
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-642-15762-2
Online ISBN:978-3-642-15763-9
eBook Packages:Computer ScienceComputer Science (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative