Possibility and impossibility results in a shared memory environment

Gadi Taubenfeld; Shlomo Moran

doi:10.1007/3-540-51687-5_48

Possibility and impossibility results in a shared memory environment

Gadi Taubenfeld, Shlomo Moran

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

Abstract

We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability of problems in the presence of multiple undetectable crash failures. Also, by using game-theoretical notions, a necessary and sufficient condition is provided, for the solvability of problems in the presence of multiple undetectable initial failures (i.e., processes may fail only prior to the execution). Our results imply that many problems such as consensus, choosing a leader, ranking, matching and sorting are unsolvable in the presence of a single crash failure, and that variants of these problems are solvable in the presence of a single crash failure, and that variants of these problems are solvable in the presence of t-1 crash failures but not in the presence of t crash failures. We show that a shared memory model can simulate various message passing models, and hence our impossibility results hold also for those message passing models. Our results extend and generalize previously known impossibility results for various asynchronous models.

Original language	English
Title of host publication	Distributed Algorithms - 3rd International Workshop, Proceedings
Editors	Jean-Claude Bermond, Michel Raynal
Publisher	Springer Verlag
Pages	254-267
Number of pages	14
ISBN (Print)	9783540516873
DOIs	https://doi.org/10.1007/3-540-51687-5_48
State	Published - 1989
Externally published	Yes
Event	3rd International Workshop on Distributed Algorithms, WDAG 1989 - Nice, France Duration: 26 Sep 1989 → 28 Sep 1989

Publication series

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

Conference

Conference	3rd International Workshop on Distributed Algorithms, WDAG 1989
Country/Territory	France
City	Nice
Period	26/09/89 → 28/09/89

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1989.

Access to Document

10.1007/3-540-51687-5_48

Cite this

Taubenfeld, G., & Moran, S. (1989). Possibility and impossibility results in a shared memory environment. In J.-C. Bermond, & M. Raynal (Eds.), Distributed Algorithms - 3rd International Workshop, Proceedings (pp. 254-267). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 392 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-51687-5_48

Taubenfeld, Gadi ; Moran, Shlomo. / Possibility and impossibility results in a shared memory environment. Distributed Algorithms - 3rd International Workshop, Proceedings. editor / Jean-Claude Bermond ; Michel Raynal. Springer Verlag, 1989. pp. 254-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e99715ee36eb4d0ea7a40bbbf822c3ff,

title = "Possibility and impossibility results in a shared memory environment",

abstract = "We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability of problems in the presence of multiple undetectable crash failures. Also, by using game-theoretical notions, a necessary and sufficient condition is provided, for the solvability of problems in the presence of multiple undetectable initial failures (i.e., processes may fail only prior to the execution). Our results imply that many problems such as consensus, choosing a leader, ranking, matching and sorting are unsolvable in the presence of a single crash failure, and that variants of these problems are solvable in the presence of a single crash failure, and that variants of these problems are solvable in the presence of t-1 crash failures but not in the presence of t crash failures. We show that a shared memory model can simulate various message passing models, and hence our impossibility results hold also for those message passing models. Our results extend and generalize previously known impossibility results for various asynchronous models.",

author = "Gadi Taubenfeld and Shlomo Moran",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1989.; 3rd International Workshop on Distributed Algorithms, WDAG 1989 ; Conference date: 26-09-1989 Through 28-09-1989",

year = "1989",

doi = "10.1007/3-540-51687-5_48",

language = "אנגלית",

isbn = "9783540516873",

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

publisher = "Springer Verlag",

pages = "254--267",

editor = "Jean-Claude Bermond and Michel Raynal",

booktitle = "Distributed Algorithms - 3rd International Workshop, Proceedings",

address = "גרמניה",

}

Taubenfeld, G & Moran, S 1989, Possibility and impossibility results in a shared memory environment. in J-C Bermond & M Raynal (eds), Distributed Algorithms - 3rd International Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 392 LNCS, Springer Verlag, pp. 254-267, 3rd International Workshop on Distributed Algorithms, WDAG 1989, Nice, France, 26/09/89. https://doi.org/10.1007/3-540-51687-5_48

Possibility and impossibility results in a shared memory environment. / Taubenfeld, Gadi; Moran, Shlomo.
Distributed Algorithms - 3rd International Workshop, Proceedings. ed. / Jean-Claude Bermond; Michel Raynal. Springer Verlag, 1989. p. 254-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 392 LNCS).

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

TY - GEN

T1 - Possibility and impossibility results in a shared memory environment

AU - Taubenfeld, Gadi

AU - Moran, Shlomo

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1989.

PY - 1989

Y1 - 1989

N2 - We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability of problems in the presence of multiple undetectable crash failures. Also, by using game-theoretical notions, a necessary and sufficient condition is provided, for the solvability of problems in the presence of multiple undetectable initial failures (i.e., processes may fail only prior to the execution). Our results imply that many problems such as consensus, choosing a leader, ranking, matching and sorting are unsolvable in the presence of a single crash failure, and that variants of these problems are solvable in the presence of a single crash failure, and that variants of these problems are solvable in the presence of t-1 crash failures but not in the presence of t crash failures. We show that a shared memory model can simulate various message passing models, and hence our impossibility results hold also for those message passing models. Our results extend and generalize previously known impossibility results for various asynchronous models.

AB - We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability of problems in the presence of multiple undetectable crash failures. Also, by using game-theoretical notions, a necessary and sufficient condition is provided, for the solvability of problems in the presence of multiple undetectable initial failures (i.e., processes may fail only prior to the execution). Our results imply that many problems such as consensus, choosing a leader, ranking, matching and sorting are unsolvable in the presence of a single crash failure, and that variants of these problems are solvable in the presence of a single crash failure, and that variants of these problems are solvable in the presence of t-1 crash failures but not in the presence of t crash failures. We show that a shared memory model can simulate various message passing models, and hence our impossibility results hold also for those message passing models. Our results extend and generalize previously known impossibility results for various asynchronous models.

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

U2 - 10.1007/3-540-51687-5_48

DO - 10.1007/3-540-51687-5_48

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

AN - SCOPUS:5344243060

SN - 9783540516873

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

SP - 254

EP - 267

BT - Distributed Algorithms - 3rd International Workshop, Proceedings

A2 - Bermond, Jean-Claude

A2 - Raynal, Michel

PB - Springer Verlag

T2 - 3rd International Workshop on Distributed Algorithms, WDAG 1989

Y2 - 26 September 1989 through 28 September 1989

ER -

Taubenfeld G, Moran S. Possibility and impossibility results in a shared memory environment. In Bermond JC, Raynal M, editors, Distributed Algorithms - 3rd International Workshop, Proceedings. Springer Verlag. 1989. p. 254-267. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-51687-5_48

Possibility and impossibility results in a shared memory environment

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this