Advertisement

Brief Announcement: Fully Anonymous Shared Memory Algorithms

  • Michel Raynal
  • Gadi TaubenfeldEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11914)

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.

Notes

Acknowledgments

M. Raynal was partially supported by the French ANR project DESCARTES (16-CE40-0023-03) devoted to layered and modular structures in distributed computing.

References

  1. 1.
    Aghazadeh, Z., Imbs, D., Raynal, M., Taubenfeld, G., Woelfel, Ph.: Optimal memory-anonymous symmetric deadlock-free mutual exclusion. In: Proceedings of 38th ACM Symposium on Principles of Distributed Computing, PODC 2019, 10 p. ACM Press (2019)Google Scholar
  2. 2.
    Navlakha, S., Bar-Joseph, Z.: Distributed information processing in biological and computational systems. Commun. ACM 58(1), 94–102 (2015)CrossRefGoogle Scholar
  3. 3.
    Raynal, M.: Concurrent Programming: Algorithms, Principles and Foundations, 515 p. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-32027-9. ISBN 978-3-642-32026-2
  4. 4.
    Raynal, M., Cao, J.: Anonymity in distributed read/write systems: an introductory survey. In: Podelski, A., Taïani, F. (eds.) NETYS 2018. LNCS, vol. 11028, pp. 122–140. Springer, Cham (2019).  https://doi.org/10.1007/978-3-030-05529-5_9CrossRefGoogle Scholar
  5. 5.
    Raynal M., Taubenfeld G.: Fully anonymous shared memory algorithms, 16 p. ArXiv-1909.05576 (2019)Google Scholar
  6. 6.
    Rashid S., Taubenfeld G., Bar-Joseph Z.: Genome wide epigenetic modifications as a shared memory consensus problem. In: 6th Workshop on Biological Distributed Algorithms, BDA 2018, London (2018)Google Scholar
  7. 7.
    Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming. Pearson Education/Prentice Hall, London/Upper Saddle River, 423 p. (2006). ISBN 0-131-97259-6Google Scholar
  8. 8.
    Taubenfeld, G.: Coordination without prior agreement. In: Proceedings of 36th ACM Symposium on Principles of Distributed Computing, PODC 2017, pp. 325–334. ACM Press (2017)Google Scholar
  9. 9.
    Taubenfeld, G.: Set agreement power is not a precise characterization for oblivious deterministic anonymous objects. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 293–308. Springer, Cham (2019).  https://doi.org/10.1007/978-3-030-24922-9_20CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Univ Rennes IRISARennesFrance
  2. 2.Department of ComputingPolytechnic UniversityKowloonHong Kong
  3. 3.The Interdisciplinary CenterHerzliyaIsrael

Personalised recommendations