A machine for uncoupled coordination and its concurrent behavior

  • Robert Tolksdorf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 924)


The family of un-coupled coordination languages — its most prominent representative is Linda — uses as a central mechanism for synchronization and communication the addition and withdrawal of elements to and from a multiset. We define a machine — the Bag-Machine — that abstracts from specific outforms of elements handled and operations in a coordination language. We give a truly concurrent behavioral specification by event structures. We further show, how the embedding of a coordination language can be formalized and demonstrate our approach by a specification of Linda.


Event Structure Parallel Composition Tuple Space Computation Language Nondeterministic Choice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Agha and Callsen, 93]
    G. Agha and C. Callsen. ActorSpaces: An Open Distributed Programming Paradigm. In Proceeding of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1993.Google Scholar
  2. [Bjornson and Carriero et al, 88]
    Robert Bjornson, Nicholas Carriero, David Gelernter, and Jerrold Leichter. Linda, the Portable Parallel. Technical Report YALE/DCS/RR-520, Yale University, 1987, revised 1988.Google Scholar
  3. [Carriero and Gelernter, 89a]
    Nicholas Carriero and David Gelernter. How to Write Parallel Programs: A Guide to the Perplexed. ACM Computing Surveys, 21(3):323–357, 1989.Google Scholar
  4. [Carriero and Gelernter, 89b]
    Nicholas Carriero and David Gelernter. Linda in Context. Communications of the ACM, 32(4):444–458, 1989.Google Scholar
  5. [Carriero and Gelernter, 89c]
    Nicholas Carriero and David Gelernter. Tuple analysis and partial evaluation strategies in the Linda precompiler. In Proceedings of the 2nd Workshop on Languages and Compilers for Parallelism, 1989.Google Scholar
  6. [Carriero and Gelernter, 91]
    Nicholas Carriero and David Gelernter. New Optimization Strategies for the Linda Pre-Compiler. In Greg Wilson, editor, Linda-Like Systems and Their Implementation, pages 74–83. Edinburgh Parallel Computing Centre, 1991. Technical Report 91-13.Google Scholar
  7. [Chiba and Kato et al, 91]
    Shigeru Chiba, Kazuhiko Kato, and Takashi Masuda. Exploiting a Weak Consistency to Implement Distributed Tuple Space. In Proceedings of the 12th IEEE International Conference on Distributed Computing Systems ICDCS 92, pages 416–423, 1991.Google Scholar
  8. [Ehrig and Mahr, 85]
    H. Ehrig and B. Mahr. Fundamentals of Algebraic Specifications 1. EATACS Monographs. Springer, 1985.Google Scholar
  9. [Gelernter and Philbin, 90]
    David Gelernter and James Philbin. Spending Your Free Time. BYTE, 15(5):213–219, 1990.Google Scholar
  10. [Mahr and StrÄter et al, 90]
    B. Mahr, W. StrÄter, and C. Umbach. Fundamentals of a Theory of Types and Declarations. Technical Report KIT-Report 82, TU-Berlin, 1990.Google Scholar
  11. [Mattson and Bjornson et al, 92]
    Timothy G. Mattson, Rob Bjornson, and David Kaminsky. The C-Linda Language for Networks of Workstations. In Workshop on Cluster Computing, Florida State University, 1992.Google Scholar
  12. [Monro, 87]
    G.P. Monro. The Concept of Multiset. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 33:171–178, 1987.Google Scholar
  13. [Roth and Setz, 92]
    Ralf Roth and Thomas Setz. LiPS: a system for distributed processing on workstations. Technical report, UniversitÄt des Saarlandes, Fachbereich 14 Informatik, 1992.Google Scholar
  14. [Schoinas, 91]
    G. Schoinas. POSYBL: Implementing the Blackboard Model in a Distributed Memory Environment Using Linda. In Greg Wilson, editor, Linda-Like Systems and Their Implementation, pages 105–116. Edinburgh Parallel Computing Centre, 1991. Technical Report 91-13.Google Scholar
  15. [SUN]
    External Data Representation: Protocol Specficiation.Google Scholar
  16. [Tolksdorf, 93]
    Robert Tolksdorf. Laura: A Coordination Language for Open Distributed Systems. In Proceedings of the 13th IEEE International Conference on Distributed Computing Systems ICDCS 93, pages 39–46, 1993.Google Scholar
  17. [Tolksdorf, 94]
    Robert Tolksdorf. Coordination in Open Distributed Systems. PhD thesis, Technische UniversitÄt Berlin, 1994.Google Scholar
  18. [Winskel, 88]
    Glynn Winskel. An introduction to event structures. In J.W. de Bakken, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pages 364–397. Springer, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Robert Tolksdorf
    • 1
  1. 1.Fachbereich 13, Informatik Funktionales und Logisches Programmieren Sekr. FR 6-10Technische Universität BerlinBerlin

Personalised recommendations