Skip to main content
SpringerLink
Log in

Distributed Linda tuplespace algorithms and implementations

  • Conference paper
  • First Online:
Book cover Parallel Processing: CONPAR 94 — VAPP VI (VAPP 1994, CONPAR 1994)

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

Abstract

Linda, a general purpose coordination language, has been used to make a language parallel. Based on a logically shared tuplespace, Linda poses difficulties to be efficiently implemented on a distributed multiprocessor system. This paper reports our approach to solve the problem: processors are divided into groups, and each group has a group manager to provide a local view of global tuplespace, and handles the tuplespace operations incurred by processors within the group. To maintain the consistency and correctness of the Linda tuplespace operations, we propose the algorithms of a group manager. We also implement the algorithms on a network of transputers, and show the experiment results.

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. S. Ahuja, N. Carriero, and D. Gelernter. Linda and friends. IEEE Computer, 19(8):26–34, 1986.

    Google Scholar 

  2. R. Bjornson, N. Carriero, D. Gelernter, D. Kaminsky, T. Mattson, and A. Sherman. Experience with Linda. Technical Report YALEU/DCS/TR-866, Department of Computer Science, Yale University, August 1991.

    Google Scholar 

  3. R. Bjornson, N. Carriero, D. Gelernter, and J. Leichter. Linda: the portable parallel. Technical Report YALEU/DCS/RR-520, Department of Computer Science, Yale University, January 1988.

    Google Scholar 

  4. N. Carriero and D. Gelernter. The S/Net's Linda kernel. ACM Transactions on Computer Systems, 4(2):110–129, May 1986.

    Google Scholar 

  5. N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(4):444–458, 1989.

    Google Scholar 

  6. C. Faasen. Intermediate uniformly distributed tuple space on transputer meshes. In Research Directions in High-level Parallel Programming Languages, pages 157–173. Springer-Verlag, 1991. LNCS 574.

    Google Scholar 

  7. C. K. Yuen, M. D. Feng, W. F. Wong, and J. J. Yee. Parallel Lisp Systems: A Study of Languages and Architectures. Chapman and Hall, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems and Computer Science, National University of Singapore, 0511, Kent Ridge, Singapore

    M. D. Feng, Y. Q. Gao & C. K. Yuen

Authors
  1. M. D. Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Q. Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. K. Yuen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Buchberger Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feng, M.D., Gao, Y.Q., Yuen, C.K. (1994). Distributed Linda tuplespace algorithms and implementations. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-58430-7_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58430-8

  • Online ISBN: 978-3-540-48789-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation