Skip to main content
SpringerLink
Log in

Multiple tuple spaces in Linda

  • Invited Lectures
  • Conference paper
  • First Online:
PARLE '89 Parallel Architectures and Languages Europe (PARLE 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 366))

Abstract

Multiple tuple spaces have been envisioned for Linda since the system's first comprehensive description; they are intended for two purposes. First, by allowing tuples to be organized into a hierarchy of separate spaces, they should make it possible to construct large Linda programs out of modules, to realize Linda's long-standing potential to be a model for persistent storage, to enforce separation between the system and users in a Linda-based operating system, and to support abstraction. Second, if we allow tuple spaces to be included among the fields of ordinary tuples, the Linda tuple-manipulation operators will allow us to operate not only on single data objects but on whole computations.

This work is supported by National Science Foundation SBIR grant ISI-8704025, by National Science Foundation CCR-8601920 and CCR-8657615, and by ONR N00014-86-K-0310. Linda is a trademark of Scientific Computing Associates, New Haven.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Ashcraft, N. Carriero and D. Gelernter, “Is Explicit Parallelism Natural? Hybrid DB search and sparse LDL T factorization using Linda.” Yale Univ. Dept. Comp. Sci. tech memo (Jan 1989).

    Google Scholar 

  2. S. Ahuja, N. Carriero D. Gelernter, and V. Krishnswamy, “Matching Language and Hardware for Parallel Computation in the Linda Machine.” IEEE Trans. Computers (special issue on Architectural Support for Languages and Operating Systems) Aug. 1988.

    Google Scholar 

  3. L. Borrman and M. Herdieckerhoff, “Linda integriert in Modula-2—ein Sparchkonzept für portable parallele Software,” in Proc. 10. GI/ITG-Fachtagung Architektur und Betrieb von Rechensystemen. (Paderborn, March 1988).

    Google Scholar 

  4. A. Black, N. Hutchinson, N. Jul and H. Levy, Object structure in the Emerald system, in Proc. ACM Conf. on Object-Oriented Prog. Sys., Lang. and Applications (Oct. 1986):78–86.

    Google Scholar 

  5. N. Carriero and D. Gelernter, “Applications Experience with Linda,” in Proc. ACM Symp. Parallel Programming, July 1988.

    Google Scholar 

  6. N. Carriero and D. Gelernter, “How to write parallel programs: A guide to the perplexed.” ACM Comp. Surveys (to appear).

    Google Scholar 

  7. W.J. Dally and A. A. Chien, “Object-oriented concurrent programming in CST”, in Proc. Third Conf. Hypercube Concurrent Computers (Jan. 1988).

    Google Scholar 

  8. R. Gabriel and J. McCarthy, “Queue-based multi-processing Lisp,” in Proc. 1984 Symp. Lisp and Func. Prog. (Aug. 1984):25–44.

    Google Scholar 

  9. Gelernter, D., An integrated microcomputer network for experiments in distributed programming. PhD Diss., SUNY Stony Brook Dept. Comp. Sci. (1983).

    Google Scholar 

  10. Gelernter, D., “Generative communication in Linda,” ACM Trans. Prog. Lang. Sys. 1(1985):80–112.

    Google Scholar 

  11. D. Gelernter, S. Jagganathan and T. London, “Environments as First Class Objects,” in Proc. ACM Symp. Principles of Prog. Languages, Jan. 1987.

    Google Scholar 

  12. D. Gelernter, S. Jagganathan and T. London, “Parallelism, Persistenc and Meta-Cleanliness in the Symmetric Lisp Interpreter,” in Proc. ACM SIGPLAN Symp. on Interpreters, June 1987.

    Google Scholar 

  13. P. Henderson, “Purely function operating systems,” in J.Darlington, P. Henderson and D.A. Turner, eds., Functional Programming and its Applications. Cambridge University Press (1982):177–192.

    Google Scholar 

  14. S. Jagannathan, A programming language supporting first-class, parallel environments. PhD Diss., MIT Lab. Comp. Sci. (1989).

    Google Scholar 

  15. E. Jul, H. Levy, N. Hutchinson and A. Black, “Fine-grained mobility in the Emerald system,” ACM Trans. Comp. Sys. 6,1(Feb. 1988):109–133.

    Google Scholar 

  16. W. Leler, “PIX, the latest NEWS,” in Proc. COMPCON Spring '89 (Feb. 1989).

    Google Scholar 

  17. S. Matsuoka and S. Kawai, “Using tuple space communication in distributed object-oriented languages,” Proc. OOPSLA '88 (Nov. 1988):276–284.

    Google Scholar 

  18. R.A. Whiteside and J.S. Leichter, “Using Linda for supercomputing on a local area network.” in Proc. Supercomputing '88 (Nov. 1988).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, New Haven, Connecticut

    David Gelernter

Authors
  1. David Gelernter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eddy Odijk Martin Rem Jean-Claude Syre

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gelernter, D. (1989). Multiple tuple spaces in Linda. In: Odijk, E., Rem, M., Syre, JC. (eds) PARLE '89 Parallel Architectures and Languages Europe. PARLE 1989. Lecture Notes in Computer Science, vol 366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51285-3_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-51285-3_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51285-1

  • Online ISBN: 978-3-540-46184-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation