And: Fully Anonymous Shared Memory Algorithms

Michel Raynal; Gadi Taubenfeld

doi:10.1007/978-3-030-34992-9_24

And: Fully Anonymous Shared Memory Algorithms

Michel Raynal, Gadi Taubenfeld

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

Abstract

Process anonymity has been studied for a long time. Memory anonymity is more recent. In an anonymous memory system, there is no a priori agreement among the processes on the names of the shared registers they access. This article introduces the fully anonymous model, namely a model in which both the processes and the memory are anonymous. It is shown that fundamental problems such as mutual exclusion, consensus, and its weak version called set agreement, can be solved despite full anonymity, the first in a failure-free system, the others in the presence of any number of process crashes.

Original language	English
Title of host publication	Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019,Proceedings
Editors	Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi
Publisher	Springer
Pages	301-306
Number of pages	6
ISBN (Print)	9783030349912
DOIs	https://doi.org/10.1007/978-3-030-34992-9_24
State	Published - 2019
Externally published	Yes
Event	21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2019 - Pisa, Italy Duration: 22 Oct 2019 → 25 Oct 2019

Publication series

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

Conference

Conference	21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2019
Country/Territory	Italy
City	Pisa
Period	22/10/19 → 25/10/19

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2019.

Access to Document

10.1007/978-3-030-34992-9_24

Cite this

Raynal, M., & Taubenfeld, G. (2019). And: Fully Anonymous Shared Memory Algorithms. In M. Ghaffari, M. Nesterenko, S. Tixeuil, S. Tucci, & Y. Yamauchi (Eds.), Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019,Proceedings (pp. 301-306). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11914 LNCS). Springer. https://doi.org/10.1007/978-3-030-34992-9_24

Raynal, Michel ; Taubenfeld, Gadi. / And : Fully Anonymous Shared Memory Algorithms. Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019,Proceedings. editor / Mohsen Ghaffari ; Mikhail Nesterenko ; Sébastien Tixeuil ; Sara Tucci ; Yukiko Yamauchi. Springer, 2019. pp. 301-306 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{00e31d37e4884197bf7a56512b55c51e,

title = "And: Fully Anonymous Shared Memory Algorithms",

abstract = "Process anonymity has been studied for a long time. Memory anonymity is more recent. In an anonymous memory system, there is no a priori agreement among the processes on the names of the shared registers they access. This article introduces the fully anonymous model, namely a model in which both the processes and the memory are anonymous. It is shown that fundamental problems such as mutual exclusion, consensus, and its weak version called set agreement, can be solved despite full anonymity, the first in a failure-free system, the others in the presence of any number of process crashes.",

author = "Michel Raynal and Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2019 ; Conference date: 22-10-2019 Through 25-10-2019",

year = "2019",

doi = "10.1007/978-3-030-34992-9_24",

language = "אנגלית",

isbn = "9783030349912",

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

publisher = "Springer",

pages = "301--306",

editor = "Mohsen Ghaffari and Mikhail Nesterenko and S{\'e}bastien Tixeuil and Sara Tucci and Yukiko Yamauchi",

booktitle = "Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019,Proceedings",

}

Raynal, M & Taubenfeld, G 2019, And: Fully Anonymous Shared Memory Algorithms. in M Ghaffari, M Nesterenko, S Tixeuil, S Tucci & Y Yamauchi (eds), Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019,Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11914 LNCS, Springer, pp. 301-306, 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2019, Pisa, Italy, 22/10/19. https://doi.org/10.1007/978-3-030-34992-9_24

And: Fully Anonymous Shared Memory Algorithms. / Raynal, Michel; Taubenfeld, Gadi.
Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019,Proceedings. ed. / Mohsen Ghaffari; Mikhail Nesterenko; Sébastien Tixeuil; Sara Tucci; Yukiko Yamauchi. Springer, 2019. p. 301-306 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11914 LNCS).

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

TY - GEN

T1 - And

T2 - 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2019

AU - Raynal, Michel

AU - Taubenfeld, Gadi

N1 - Publisher Copyright: © Springer Nature Switzerland AG 2019.

PY - 2019

Y1 - 2019

N2 - Process anonymity has been studied for a long time. Memory anonymity is more recent. In an anonymous memory system, there is no a priori agreement among the processes on the names of the shared registers they access. This article introduces the fully anonymous model, namely a model in which both the processes and the memory are anonymous. It is shown that fundamental problems such as mutual exclusion, consensus, and its weak version called set agreement, can be solved despite full anonymity, the first in a failure-free system, the others in the presence of any number of process crashes.

AB - Process anonymity has been studied for a long time. Memory anonymity is more recent. In an anonymous memory system, there is no a priori agreement among the processes on the names of the shared registers they access. This article introduces the fully anonymous model, namely a model in which both the processes and the memory are anonymous. It is shown that fundamental problems such as mutual exclusion, consensus, and its weak version called set agreement, can be solved despite full anonymity, the first in a failure-free system, the others in the presence of any number of process crashes.

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

U2 - 10.1007/978-3-030-34992-9_24

DO - 10.1007/978-3-030-34992-9_24

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85076679003

SN - 9783030349912

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

SP - 301

EP - 306

BT - Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019,Proceedings

A2 - Ghaffari, Mohsen

A2 - Nesterenko, Mikhail

A2 - Tixeuil, Sébastien

A2 - Tucci, Sara

A2 - Yamauchi, Yukiko

PB - Springer

Y2 - 22 October 2019 through 25 October 2019

ER -

Raynal M, Taubenfeld G. And: Fully Anonymous Shared Memory Algorithms. In Ghaffari M, Nesterenko M, Tixeuil S, Tucci S, Yamauchi Y, editors, Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019,Proceedings. Springer. 2019. p. 301-306. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-34992-9_24

And: Fully Anonymous Shared Memory Algorithms

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this