Coordination without prior agreement

Gadi Taubenfeld

doi:10.1145/3087801.3087807

Coordination without prior agreement

Gadi Taubenfeld

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

Abstract

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 language	English
Title of host publication	PODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	325-334
Number of pages	10
ISBN (Electronic)	9781450349925
DOIs	https://doi.org/10.1145/3087801.3087807
State	Published - 26 Jul 2017
Externally published	Yes
Event	36th ACM Symposium on Principles of Distributed Computing, PODC 2017 - Washington, United States Duration: 25 Jul 2017 → 27 Jul 2017

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume	Part F129314

Conference

Conference	36th ACM Symposium on Principles of Distributed Computing, PODC 2017
Country/Territory	United States
City	Washington
Period	25/07/17 → 27/07/17

Bibliographical note

Publisher Copyright:
© 2017 Association for Computing Machinery.

Keywords

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

Access to Document

10.1145/3087801.3087807

Cite this

@inproceedings{cde7c049f0c74f88a72d48d9bdb3ea53,

title = "Coordination without prior agreement",

abstract = "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.",

keywords = "Agreement, Anonymous register, Memory-anonymous algorithms, Mutual exclusion, Renaming, Shared memory, Unnamed register",

author = "Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} 2017 Association for Computing Machinery.; 36th ACM Symposium on Principles of Distributed Computing, PODC 2017 ; Conference date: 25-07-2017 Through 27-07-2017",

year = "2017",

month = jul,

day = "26",

doi = "10.1145/3087801.3087807",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "325--334",

booktitle = "PODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing",

}

Taubenfeld, G 2017, Coordination without prior agreement. in PODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. Part F129314, Association for Computing Machinery, pp. 325-334, 36th ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, United States, 25/07/17. https://doi.org/10.1145/3087801.3087807

Coordination without prior agreement. / Taubenfeld, Gadi.
PODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2017. p. 325-334 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. Part F129314).

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

TY - GEN

T1 - Coordination without prior agreement

AU - Taubenfeld, Gadi

PY - 2017/7/26

Y1 - 2017/7/26

N2 - 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.

AB - 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.

KW - Agreement

KW - Anonymous register

KW - Memory-anonymous algorithms

KW - Mutual exclusion

KW - Renaming

KW - Shared memory

KW - Unnamed register

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

U2 - 10.1145/3087801.3087807

DO - 10.1145/3087801.3087807

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

AN - SCOPUS:85027880201

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 325

EP - 334

BT - PODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

T2 - 36th ACM Symposium on Principles of Distributed Computing, PODC 2017

Y2 - 25 July 2017 through 27 July 2017

ER -

Coordination without prior agreement

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this