Preview
Unable to display preview. Download preview PDF.
References
S. Ahuja et al. Linda and friends. IEEE Computer, August 1986.
N. Carriero. Implementation of Tuple Space Machines. PhD thesis, Yale University, December 1987.
N. Carriero and D. Gelernter. Applications experience with linda. In Proceedings of the ACM/SIGPLAN PPEALS. ACM, 1988.
N. Carriero and D. Gelernter. How to write parallel programs: A guide to the perplexed. ACM Computing Surveys, 21(3), September 1989.
Harvey M. Deitel. An Introduction to Operating Systems. Addison-Wesley, 1984.
D. Shasha and J. Turek. Beyond fail-stop: Wait-free serializability and resiliency in the presence of slow-down failures. New York University Computer Science Technical Report 514, September 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anderson, B.G., Shasha, D. (1992). Persistent Linda: Linda + transactions + query processing. In: Banâtre, J., Le Métayer, D. (eds) Reasearch Directions in High-Level Parallel Programming Languages. HLPPP 1991. Lecture Notes in Computer Science, vol 574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55160-3_37
Download citation
DOI: https://doi.org/10.1007/3-540-55160-3_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55160-7
Online ISBN: 978-3-540-46762-5
eBook Packages: Springer Book Archive