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 precence 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 precence of multiple undetectable initial failures
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 t − 1 crash failures but not in the presence of t crash failures.
We show that a shared memory model simulate various message passing models, and hence our impossibility results hold also for those message passing models. Our results extend and generalize known impossibility results for various asynchronous models.
Supported in part by the National Science Foundation under grant CCR-8405478, by the Hebrew Technical Institute scholarship, and by the Guttwirth Fellowship.
Supported in part by Technion V.P.R. Funds — Wellner Research Fund, and by the Foundation for Research in Electronics, Computers and Communications, administrated by the Israel Academy of Sciences and Humanities.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Abrahamson, K. On achieving consensus using shared memory, ACM-PODC 1988, 291–302.
Attiya, H., Bar-Noy, A., Dolev, D., Koller, D., Peleg, D., and Reischuk, R. Achievable cases in an asynchronous environment, ACM-FOCS 1987, 337–346.
Biran, O., Moran S., and Zaks, S. A Combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor, ACM-PODC 1988, 263–275.
Bridgland, M., and Watro, R. Fault-tolerant decision making in totally asynchronous distributed systems, ACM-PODC 1987, 52–63.
Chor, B., and Moscovici, L. Solvability in asynchronous environments, manuscript, 1989.
Chor, B., Israeli, A., and Li, M. On processor coordination using asynchronous hardware, ACM-PODC 1987, 86–97.
Chandy, M., and Misra, J. On the nonexistence of robust commit protocols, Unpublished manuscript, November 1985.
Chandy, M., and Misra, J. How processes learn, Distributed Computing 1986, 40–52.
Dolev, D., Dwork, C., Stockmeyer, L. On the minimal synchronism needed for distributed consensus, JACM 34, 1, 1987, 77–97.
Dwork, C., Lynch, N., Stockmeyer, L. Consensus in the presence of partial synchrony, JACM 35, 2, 1988, 288–323.
Fischer, M., Lynch, N., Paterson, M. Impossibility of distributed consensus with one faulty process, JACM 32, 2, 1985, 374–382.
Herlihy, P.M. Impossibility and universality results for wait-free synchronization, ACM-PODC 1988, 276–290.
Loui, C.M., and Abu-Amara, H. Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research 4, 1988.
Moran, S., and Wolfstahl, Y. An extended impossibility result for asynchronous complete networks, IPL 26, November 1987, 145–151.
Taubenfeld, G. Impossibility Results for Decision Protocols, Technion Technical Report #445, January 1987. Revised version, Technion TR #506, April 1988.
Taubenfeld, G. Leader election in the presence of n − 1 initial failures, Yale technical report YALEU/DCS/TR-709 (May 1989).
Taubenfeld, G., Katz, S., and Moran, S. Impossibility results in the presence of multiple faulty processes, Technion Technical Report #492, January 1988.
Taubenfeld, G., Katz, S., and Moran, S. Initial failures in distributed computations, Technion Technical Report #517, August 1988.
Taubenfeld, G., and Moran, S. Possibility and impossibility results in a shared memory environment, Yale technical report YALEU/DCS/TR-708 (May 1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taubenfeld, G., Moran, S. (1989). Possibility and impossibility results in a shared memory environment. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_48
Download citation
DOI: https://doi.org/10.1007/3-540-51687-5_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51687-3
Online ISBN: 978-3-540-46750-2
eBook Packages: Springer Book Archive