Skip to Main content Skip to Navigation
Conference papers

Brief Announcement: Sharing Memory in a Self-stabilizing Manner

Abstract : 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].)
Document type :
Conference papers
Complete list of metadata
Contributor : Lip6 Publications <>
Submitted on : Friday, March 25, 2016 - 3:12:33 PM
Last modification on : Friday, January 8, 2021 - 5:46:03 PM

Links full text



Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, et al.. Brief Announcement: Sharing Memory in a Self-stabilizing Manner. 24th International Symposium Distributed Computing DISC, Sep 2010, Cambridge, MA, United States. pp.525-527, ⟨10.1007/978-3-642-15763-9_49⟩. ⟨hal-01293831⟩