Fully Anonymous Consensus and Set Agreement Algorithms

Michel Raynal, Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationNetworked Systems - 8th International Conference, NETYS 2020, Proceedings
EditorsChryssis Georgiou, Rupak Majumdar
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages15
ISBN (Print)9783030670863
StatePublished - 2021
Externally publishedYes
Event8th International Conference on Networked Systems, NETYS 2020 - Marrakech, Morocco
Duration: 3 Jun 20205 Jun 2020

Publication series

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


Conference8th International Conference on Networked Systems, NETYS 2020

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.


  • 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


Dive into the research topics of 'Fully Anonymous Consensus and Set Agreement Algorithms'. Together they form a unique fingerprint.

Cite this