Fully Anonymous Consensus and Set Agreement Algorithms

Michel Raynal; Gadi Taubenfeld

doi:10.1007/978-3-030-67087-0_20

Fully Anonymous Consensus and Set Agreement 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. As an example, a shared register named A by a process p and a shared register named B by another process q may correspond to the very same register X, while the same name C may correspond to different shared registers for the processes p and q. This article focuses on solving the consensus and set agreement problems in the fully anonymous model, namely a model in which both the processes and the registers are anonymous. It is shown that consensus, and its weak version called set agreement, can be solved despite full anonymity, in the presence of any number of process crashes. As far as we know, this is the first time where non-trivial concurrency-related problems are solved in such a strong anonymity context. A noteworthy property of the proposed algorithms lies in their conceptual simplicity.

Original language	English
Title of host publication	Networked Systems - 8th International Conference, NETYS 2020, Proceedings
Editors	Chryssis Georgiou, Rupak Majumdar
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	314-328
Number of pages	15
ISBN (Print)	9783030670863
DOIs	https://doi.org/10.1007/978-3-030-67087-0_20
State	Published - 2021
Externally published	Yes
Event	8th International Conference on Networked Systems, NETYS 2020 - Marrakech, Morocco Duration: 3 Jun 2020 → 5 Jun 2020

Publication series

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

Conference

Conference	8th International Conference on Networked Systems, NETYS 2020
Country/Territory	Morocco
City	Marrakech
Period	3/06/20 → 5/06/20

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

Keywords

Anonymity
Anonymous processes
Anonymous shared memory
Asynchrony
Atomic read/modify/write register
Atomic read/write register
Concurrency
Consensus
Crash failure
Obstruction-freedom
Process crash
Set agreement
Wait-freedom

Access to Document

10.1007/978-3-030-67087-0_20

Cite this

Raynal, M., & Taubenfeld, G. (2021). Fully Anonymous Consensus and Set Agreement Algorithms. In C. Georgiou, & R. Majumdar (Eds.), Networked Systems - 8th International Conference, NETYS 2020, Proceedings (pp. 314-328). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12129 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-67087-0_20

Raynal, Michel ; Taubenfeld, Gadi. / Fully Anonymous Consensus and Set Agreement Algorithms. Networked Systems - 8th International Conference, NETYS 2020, Proceedings. editor / Chryssis Georgiou ; Rupak Majumdar. Springer Science and Business Media Deutschland GmbH, 2021. pp. 314-328 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8de69ccc2a7a4ffba0499073662478dc,

title = "Fully Anonymous Consensus and Set Agreement 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. As an example, a shared register named A by a process p and a shared register named B by another process q may correspond to the very same register X, while the same name C may correspond to different shared registers for the processes p and q. This article focuses on solving the consensus and set agreement problems in the fully anonymous model, namely a model in which both the processes and the registers are anonymous. It is shown that consensus, and its weak version called set agreement, can be solved despite full anonymity, in the presence of any number of process crashes. As far as we know, this is the first time where non-trivial concurrency-related problems are solved in such a strong anonymity context. A noteworthy property of the proposed algorithms lies in their conceptual simplicity.",

keywords = "Anonymity, Anonymous processes, Anonymous shared memory, Asynchrony, Atomic read/modify/write register, Atomic read/write register, Concurrency, Consensus, Crash failure, Obstruction-freedom, Process crash, Set agreement, Wait-freedom",

author = "Michel Raynal and Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} 2021, Springer Nature Switzerland AG.; 8th International Conference on Networked Systems, NETYS 2020 ; Conference date: 03-06-2020 Through 05-06-2020",

year = "2021",

doi = "10.1007/978-3-030-67087-0_20",

language = "אנגלית",

isbn = "9783030670863",

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

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "314--328",

editor = "Chryssis Georgiou and Rupak Majumdar",

booktitle = "Networked Systems - 8th International Conference, NETYS 2020, Proceedings",

address = "גרמניה",

}

Raynal, M & Taubenfeld, G 2021, Fully Anonymous Consensus and Set Agreement Algorithms. in C Georgiou & R Majumdar (eds), Networked Systems - 8th International Conference, NETYS 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12129 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 314-328, 8th International Conference on Networked Systems, NETYS 2020, Marrakech, Morocco, 3/06/20. https://doi.org/10.1007/978-3-030-67087-0_20

Fully Anonymous Consensus and Set Agreement Algorithms. / Raynal, Michel; Taubenfeld, Gadi.
Networked Systems - 8th International Conference, NETYS 2020, Proceedings. ed. / Chryssis Georgiou; Rupak Majumdar. Springer Science and Business Media Deutschland GmbH, 2021. p. 314-328 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12129 LNCS).

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

TY - GEN

T1 - Fully Anonymous Consensus and Set Agreement Algorithms

AU - Raynal, Michel

AU - Taubenfeld, Gadi

PY - 2021

Y1 - 2021

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. As an example, a shared register named A by a process p and a shared register named B by another process q may correspond to the very same register X, while the same name C may correspond to different shared registers for the processes p and q. This article focuses on solving the consensus and set agreement problems in the fully anonymous model, namely a model in which both the processes and the registers are anonymous. It is shown that consensus, and its weak version called set agreement, can be solved despite full anonymity, in the presence of any number of process crashes. As far as we know, this is the first time where non-trivial concurrency-related problems are solved in such a strong anonymity context. A noteworthy property of the proposed algorithms lies in their conceptual simplicity.

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. As an example, a shared register named A by a process p and a shared register named B by another process q may correspond to the very same register X, while the same name C may correspond to different shared registers for the processes p and q. This article focuses on solving the consensus and set agreement problems in the fully anonymous model, namely a model in which both the processes and the registers are anonymous. It is shown that consensus, and its weak version called set agreement, can be solved despite full anonymity, in the presence of any number of process crashes. As far as we know, this is the first time where non-trivial concurrency-related problems are solved in such a strong anonymity context. A noteworthy property of the proposed algorithms lies in their conceptual simplicity.

KW - Anonymity

KW - Anonymous processes

KW - Anonymous shared memory

KW - Asynchrony

KW - Atomic read/modify/write register

KW - Atomic read/write register

KW - Concurrency

KW - Consensus

KW - Crash failure

KW - Obstruction-freedom

KW - Process crash

KW - Set agreement

KW - Wait-freedom

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

U2 - 10.1007/978-3-030-67087-0_20

DO - 10.1007/978-3-030-67087-0_20

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

AN - SCOPUS:85101542052

SN - 9783030670863

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

SP - 314

EP - 328

BT - Networked Systems - 8th International Conference, NETYS 2020, Proceedings

A2 - Georgiou, Chryssis

A2 - Majumdar, Rupak

PB - Springer Science and Business Media Deutschland GmbH

T2 - 8th International Conference on Networked Systems, NETYS 2020

Y2 - 3 June 2020 through 5 June 2020

ER -

Raynal M, Taubenfeld G. Fully Anonymous Consensus and Set Agreement Algorithms. In Georgiou C, Majumdar R, editors, Networked Systems - 8th International Conference, NETYS 2020, Proceedings. Springer Science and Business Media Deutschland GmbH. 2021. p. 314-328. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-67087-0_20

Fully Anonymous Consensus and Set Agreement Algorithms

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this