Abstract
Linda is a very high level communication model which allows processes to communicate without knowing each other's identities and without having to arrange for a definite rendezvous. This high level of abstraction would make Linda particularly suitable for use as a coordination model for open systems, if it were not for the fact that the Linda communication is very unsafe. We propose to remove this deficiency of Linda by means of the concept of law-governed architecture previously applied to centralized and message passing systems. We define a model for Law-Governed Linda (LGL) communication, and we demonstrate its efficacy by means of several illustrative examples.
Work supported in part by NSF grants No. CCR-8807803 and No. CCR-9308773.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Robert Bjornson. Linda on distributed memory multiprocessors. Technical Report RR-931, Yale University Department of Computer Science, November 1992. Also a 1993 Yale University PhD thesis.
Nicholas Carriero and David Gelernter. The S/Net's Linda kernel. ACM Transactions on Computer Systems, 4(2), May 1986.
Nicholas Carriero and David Gelernter. Applications experience with Linda. ACM SIGPLAN Notices, 23(9), September 1988. Proceedings of ACM/SIGPLAN PPEALS 1988.
Paolo Ciancarini. Enacting rule-based software processes with polis. Technical report, University of Pisa, October 1991.
W.F. Clocksin and C.S. Mellish. Programming in Prolog. Springer-Verlag, 1981.
P.J. Denning and G. S. Graham. Protection — principles and practice. In AFIPS 1972 Spring Joint Computer Conf., pages 417–429. AFIPS, 1972.
D. Gelenter and N. Carriero. Coordination languages and their significance. Communications of the ACM, 35(2):97–107, February 1992.
David H. Gelernter. Generative communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1), January 1985.
K.M. Kahn and M.S. Miller. A letter about the article’ Linda in Context’ by Carrierro and Gelernter. Communications of the ACM, 32(10):1253–1255, Oct. 1989.
B.W. Lampson. A note on the confinement problem. Communications of the ACM, 16(10):613–615, Oct. 1976.
Jerrold Leichter and Naftaly H. Minsky. Obligations in law governed distributed systems. In preparation.
Jerrold S. Leichter. Shared tuple memories, shared memories, buses and LAN's — Linda implementations across the spectrum of connectivity. Technical Report TR-714, Yale University Department of Computer Science, July 1989. Also a 1989 Yale University PhD thesis.
N.H. Minsky. The imposition of protocols over open distributed systems. IEEE Transactions on Software Engineering, February 1991.
N.H. Minsky and A. Lockman. Ensuring integrity by adding obligations to privileges. In Proceedings of the 8th International Conference on Software Engineering, pages 92–102, August 1985.
J. Pinakis. Providing directed communication in linda. In Proceedings of the 15th Australian Computer Science Conf., pages 731–743, 1992.
Robert A. Whiteside and Jerrold S. Leichter. Using Linda for supercomputing on a local area network. In Proceedings, Supercomputing '88, November 1988. Also Yale University Department of Computer Science Technical Report TR-638 and Sandia National Laboratories Report SAND88-8818, both June 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Minsky, N.H., Leichter, J. (1995). Law-governed linda as a coordination model. In: Ciancarini, P., Nierstrasz, O., Yonezawa, A. (eds) Object-Based Models and Languages for Concurrent Systems. ECOOP 1994. Lecture Notes in Computer Science, vol 924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59450-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-59450-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59450-5
Online ISBN: 978-3-540-49269-6
eBook Packages: Springer Book Archive