Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A machine for uncoupled coordination and its concurrent behavior

  • Conference paper
  • First Online:
Object-Based Models and Languages for Concurrent Systems (ECOOP 1994)

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

Included in the following conference series:

  • 132 Accesses

Abstract

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.

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. 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. 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. 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. Nicholas Carriero and David Gelernter. Linda in Context. Communications of the ACM, 32(4):444–458, 1989.

    Google Scholar 

  5. 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. 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. 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. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specifications 1. EATACS Monographs. Springer, 1985.

    Google Scholar 

  9. David Gelernter and James Philbin. Spending Your Free Time. BYTE, 15(5):213–219, 1990.

    Google Scholar 

  10. 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. 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. G.P. Monro. The Concept of Multiset. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 33:171–178, 1987.

    Google Scholar 

  13. 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. 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. External Data Representation: Protocol Specficiation.

    Google Scholar 

  16. 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. Robert Tolksdorf. Coordination in Open Distributed Systems. PhD thesis, Technische UniversitÄt Berlin, 1994.

    Google Scholar 

  18. 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 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 13, Informatik Funktionales und Logisches Programmieren Sekr. FR 6-10, Technische Universität Berlin, Franklinstr. 28/29, D-10587, Berlin

    Robert Tolksdorf

Authors
  1. Robert Tolksdorf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paolo Ciancarini Oscar Nierstrasz Akinori Yonezawa

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tolksdorf, R. (1995). A machine for uncoupled coordination and its concurrent behavior. 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_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-59450-7_11

  • 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

Publish with us

Policies and ethics

Search

Navigation