Brief announcement: Sharing memory in a self-stabilizing manner

Noga Alon; Hagit Attiya; Shlomi Dolev; Swan Dubois; Maria Gradinariu; Sébastien Tixeuil

doi:10.1007/978-3-642-15763-9_49

Brief announcement: Sharing memory in a self-stabilizing manner

Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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].).

Original language	English
Title of host publication	Distributed Computing - 24th International Symposium, DISC 2010, Proceedings
Pages	525-527
Number of pages	3
DOIs	https://doi.org/10.1007/978-3-642-15763-9_49
State	Published - 13 Dec 2010
Event	24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States Duration: 13 Sep 2010 → 15 Sep 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6343 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	24th International Symposium on Distributed Computing, DISC 2010
Country/Territory	United States
City	Cambridge, MA
Period	13/09/10 → 15/09/10

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-15763-9_49

Cite this

Alon, N., Attiya, H., Dolev, S., Dubois, S., Gradinariu, M., & Tixeuil, S. (2010). Brief announcement: Sharing memory in a self-stabilizing manner. In Distributed Computing - 24th International Symposium, DISC 2010, Proceedings (pp. 525-527). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6343 LNCS). https://doi.org/10.1007/978-3-642-15763-9_49

@inproceedings{67dd82b3321d468082147f22785a3e45,

title = "Brief announcement: Sharing memory in a self-stabilizing manner",

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].).",

author = "Noga Alon and Hagit Attiya and Shlomi Dolev and Swan Dubois and Maria Gradinariu and S{\'e}bastien Tixeuil",

note = "Funding Information: 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 the Israel 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.; 24th International Symposium on Distributed Computing, DISC 2010 ; Conference date: 13-09-2010 Through 15-09-2010",

year = "2010",

month = dec,

day = "13",

doi = "10.1007/978-3-642-15763-9_49",

language = "English",

isbn = "3642157629",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "525--527",

booktitle = "Distributed Computing - 24th International Symposium, DISC 2010, Proceedings",

}

Alon, N, Attiya, H, Dolev, S, Dubois, S, Gradinariu, M & Tixeuil, S 2010, Brief announcement: Sharing memory in a self-stabilizing manner. in Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6343 LNCS, pp. 525-527, 24th International Symposium on Distributed Computing, DISC 2010, Cambridge, MA, United States, 13/09/10. https://doi.org/10.1007/978-3-642-15763-9_49

Brief announcement: Sharing memory in a self-stabilizing manner. / Alon, Noga; Attiya, Hagit; Dolev, Shlomi et al.
Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. 2010. p. 525-527 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6343 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Brief announcement

T2 - 24th International Symposium on Distributed Computing, DISC 2010

AU - Alon, Noga

AU - Attiya, Hagit

AU - Dolev, Shlomi

AU - Dubois, Swan

AU - Gradinariu, Maria

AU - Tixeuil, Sébastien

N1 - Funding Information: 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 the Israel 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.

PY - 2010/12/13

Y1 - 2010/12/13

N2 - 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].).

AB - 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].).

UR - http://www.scopus.com/inward/record.url?scp=78649857708&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15763-9_49

DO - 10.1007/978-3-642-15763-9_49

M3 - Conference contribution

AN - SCOPUS:78649857708

SN - 3642157629

SN - 9783642157622

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 525

EP - 527

BT - Distributed Computing - 24th International Symposium, DISC 2010, Proceedings

Y2 - 13 September 2010 through 15 September 2010

ER -

Alon N, Attiya H, Dolev S, Dubois S, Gradinariu M, Tixeuil S. Brief announcement: Sharing memory in a self-stabilizing manner. In Distributed Computing - 24th International Symposium, DISC 2010, Proceedings. 2010. p. 525-527. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-15763-9_49

Brief announcement: Sharing memory in a self-stabilizing manner

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this