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].)
Type de document :
Communication dans un congrès
24th International Symposium Distributed Computing DISC, Sep 2010, Cambridge, MA, United States. Springer, 24th International Symposium Distributed Computing DISC, 6343, pp.525-527, Lecture Notes in Computer Science. 〈10.1007/978-3-642-15763-9_49〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01293831
Contributeur : Lip6 Publications <>
Soumis le : vendredi 25 mars 2016 - 15:12:33
Dernière modification le : vendredi 31 août 2018 - 09:25:55

Lien texte intégral

Identifiants

Collections

Citation

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. Springer, 24th International Symposium Distributed Computing DISC, 6343, pp.525-527, Lecture Notes in Computer Science. 〈10.1007/978-3-642-15763-9_49〉. 〈hal-01293831〉

Partager

Métriques

Consultations de la notice

156