Coordination without prior agreement

Gadi Taubenfeld

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


Assuming that there is an a priori agreement between processes on the names of shared memory locations, as done in almost all the publications on shared memory algorithms, is tantamount to assuming that agreement has already been solved at the lower-level. From a theoretical point of view, it is intriguing to figure out how coordination can be achieved without relying on such lower-level agreement. In order to better understand the new model, we have designed new algorithms without relying on such a priori lower-level agreement, and proved space lower bounds and impossibility results for several important problems, such as mutual exclusion, consensus, election and renaming. Using these results, we identify fundamental differences between the standard model where there is a lower-level agreement about the shared register's names and the strictly weaker model where there is no such agreement.

Original languageEnglish
Title of host publicationPODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Number of pages10
ISBN (Electronic)9781450349925
StatePublished - 26 Jul 2017
Externally publishedYes
Event36th ACM Symposium on Principles of Distributed Computing, PODC 2017 - Washington, United States
Duration: 25 Jul 201727 Jul 2017

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing
VolumePart F129314


Conference36th ACM Symposium on Principles of Distributed Computing, PODC 2017
Country/TerritoryUnited States

Bibliographical note

Publisher Copyright:
© 2017 Association for Computing Machinery.


  • Agreement
  • Anonymous register
  • Memory-anonymous algorithms
  • Mutual exclusion
  • Renaming
  • Shared memory
  • Unnamed register


Dive into the research topics of 'Coordination without prior agreement'. Together they form a unique fingerprint.

Cite this