Set agreement power is not a precise characterization for oblivious deterministic anonymous objects

Gadi Taubenfeld

doi:10.1007/978-3-030-24922-9_20

Set agreement power is not a precise characterization for oblivious deterministic anonymous objects

Gadi Taubenfeld

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

Abstract

Anonymous shared memory systems, recently introduced in [36], are composed of objects for which there is no a priori agreement between processes on their names. We resolve the following foundational open problems in theoretical distributed computing, for a model which includes both non-anonymous and anonymous shared objects: (1) Are non-trivial oblivious deterministic objects with the same set agreement power have the same computational power? (2) Is there a non-trivial oblivious deterministic object which is strictly weaker than an atomic read/write register? We prove that the answer to the first problem is negative, while the answer to the second problem is positive. The positive answer to the second problem implies that the common belief that every non-trivial deterministic object of consensus number one is at least as strong as atomic read/write registers is false. A noteworthy property of the proofs of our results lies in their simplicity.

Original language	English
Title of host publication	Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings
Editors	Keren Censor-Hillel, Michele Flammini
Publisher	Springer Verlag
Pages	293-308
Number of pages	16
ISBN (Print)	9783030249212
DOIs	https://doi.org/10.1007/978-3-030-24922-9_20
State	Published - 2019
Externally published	Yes
Event	26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019 - L'Aquila, Italy Duration: 1 Jul 2019 → 4 Jul 2019

Publication series

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

Conference

Conference	26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019
Country/Territory	Italy
City	L'Aquila
Period	1/07/19 → 4/07/19

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2019.

Keywords

Anonymous objects
Anonymous shared memory
Consensus
RMW registers
Read/write registers
Set agreement

Access to Document

10.1007/978-3-030-24922-9_20

Cite this

Taubenfeld, G. (2019). Set agreement power is not a precise characterization for oblivious deterministic anonymous objects. In K. Censor-Hillel, & M. Flammini (Eds.), Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings (pp. 293-308). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11639 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-24922-9_20

Taubenfeld, Gadi. / Set agreement power is not a precise characterization for oblivious deterministic anonymous objects. Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings. editor / Keren Censor-Hillel ; Michele Flammini. Springer Verlag, 2019. pp. 293-308 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8e64a7c06e4f45fba61d53205f0b71cf,

title = "Set agreement power is not a precise characterization for oblivious deterministic anonymous objects",

abstract = "Anonymous shared memory systems, recently introduced in [36], are composed of objects for which there is no a priori agreement between processes on their names. We resolve the following foundational open problems in theoretical distributed computing, for a model which includes both non-anonymous and anonymous shared objects: (1) Are non-trivial oblivious deterministic objects with the same set agreement power have the same computational power? (2) Is there a non-trivial oblivious deterministic object which is strictly weaker than an atomic read/write register? We prove that the answer to the first problem is negative, while the answer to the second problem is positive. The positive answer to the second problem implies that the common belief that every non-trivial deterministic object of consensus number one is at least as strong as atomic read/write registers is false. A noteworthy property of the proofs of our results lies in their simplicity.",

keywords = "Anonymous objects, Anonymous shared memory, Consensus, RMW registers, Read/write registers, Set agreement",

author = "Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019 ; Conference date: 01-07-2019 Through 04-07-2019",

year = "2019",

doi = "10.1007/978-3-030-24922-9_20",

language = "אנגלית",

isbn = "9783030249212",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "293--308",

editor = "Keren Censor-Hillel and Michele Flammini",

booktitle = "Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings",

address = "גרמניה",

}

Taubenfeld, G 2019, Set agreement power is not a precise characterization for oblivious deterministic anonymous objects. in K Censor-Hillel & M Flammini (eds), Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11639 LNCS, Springer Verlag, pp. 293-308, 26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019, L'Aquila, Italy, 1/07/19. https://doi.org/10.1007/978-3-030-24922-9_20

Set agreement power is not a precise characterization for oblivious deterministic anonymous objects. / Taubenfeld, Gadi.
Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings. ed. / Keren Censor-Hillel; Michele Flammini. Springer Verlag, 2019. p. 293-308 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11639 LNCS).

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

TY - GEN

T1 - Set agreement power is not a precise characterization for oblivious deterministic anonymous objects

AU - Taubenfeld, Gadi

N1 - Publisher Copyright: © Springer Nature Switzerland AG 2019.

PY - 2019

Y1 - 2019

N2 - Anonymous shared memory systems, recently introduced in [36], are composed of objects for which there is no a priori agreement between processes on their names. We resolve the following foundational open problems in theoretical distributed computing, for a model which includes both non-anonymous and anonymous shared objects: (1) Are non-trivial oblivious deterministic objects with the same set agreement power have the same computational power? (2) Is there a non-trivial oblivious deterministic object which is strictly weaker than an atomic read/write register? We prove that the answer to the first problem is negative, while the answer to the second problem is positive. The positive answer to the second problem implies that the common belief that every non-trivial deterministic object of consensus number one is at least as strong as atomic read/write registers is false. A noteworthy property of the proofs of our results lies in their simplicity.

AB - Anonymous shared memory systems, recently introduced in [36], are composed of objects for which there is no a priori agreement between processes on their names. We resolve the following foundational open problems in theoretical distributed computing, for a model which includes both non-anonymous and anonymous shared objects: (1) Are non-trivial oblivious deterministic objects with the same set agreement power have the same computational power? (2) Is there a non-trivial oblivious deterministic object which is strictly weaker than an atomic read/write register? We prove that the answer to the first problem is negative, while the answer to the second problem is positive. The positive answer to the second problem implies that the common belief that every non-trivial deterministic object of consensus number one is at least as strong as atomic read/write registers is false. A noteworthy property of the proofs of our results lies in their simplicity.

KW - Anonymous objects

KW - Anonymous shared memory

KW - Consensus

KW - RMW registers

KW - Read/write registers

KW - Set agreement

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

U2 - 10.1007/978-3-030-24922-9_20

DO - 10.1007/978-3-030-24922-9_20

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

AN - SCOPUS:85069818103

SN - 9783030249212

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 293

EP - 308

BT - Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings

A2 - Censor-Hillel, Keren

A2 - Flammini, Michele

PB - Springer Verlag

T2 - 26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019

Y2 - 1 July 2019 through 4 July 2019

ER -

Taubenfeld G. Set agreement power is not a precise characterization for oblivious deterministic anonymous objects. In Censor-Hillel K, Flammini M, editors, Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings. Springer Verlag. 2019. p. 293-308. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-24922-9_20

Set agreement power is not a precise characterization for oblivious deterministic anonymous objects

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this