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.
|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|
|Number of pages||15|
|State||Published - 2021|
|Event||8th International Conference on Networked Systems, NETYS 2020 - Marrakech, Morocco|
Duration: 3 Jun 2020 → 5 Jun 2020
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||8th International Conference on Networked Systems, NETYS 2020|
|Period||3/06/20 → 5/06/20|
Bibliographical noteFunding Information:
M. Raynal was partially supported by the French ANR project DESCARTES (16-CE40-0023-03) devoted to layered and modular structures in distributed computing.
© 2021, Springer Nature Switzerland AG.
- Anonymous processes
- Anonymous shared memory
- Atomic read/modify/write register
- Atomic read/write register
- Crash failure
- Process crash
- Set agreement