Skip to main content
SpringerLink
Log in

Extending the Matching Facilities of Linda

  • Conference paper
  • First Online:
Coordination Models and Languages (COORDINATION 2002)

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

Included in the following conference series:

Abstract

This paper discusses the associative matching mechanism used in the Linda coordination language for the retrieval of data. There are a number of problems with this mechanism which are discussed in the light of the requirements of applications using Linda. A number of solutions to these problems have been proposed. These are discussed and compared with a new approach to solving these problems. The benefits and the limitations of the new approach are considered, showing how it provides a considerable improvement in this area.

Linda is a registered trademark of Scientific Computing Associates.

Java is a registered trademark of Sun Microsystems, Inc.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gelernter, D.: Generative communication in Linda. ACM Trans. Programming Languages and Systems 7 (1985) 80–112

    Article  MATH  Google Scholar 

  2. Wycko., P., McLaughry, S.W., Lehman, T.J., Ford, D.A.: T Spaces. IBM Systems Journal 37 (1998) 454–474

    Article  Google Scholar 

  3. Tolksdorf, R., Glaubitz, D.: Coordinating web-based systems with documents in XMLSpaces. URL: http://flp.cs.tu-berlin.de/~tolk/xmlspaces/-webxmlspaces.pdf(2001)

  4. Butcher, P., Wood, A., Atkins, M.: Global synchronisation in Linda. Concurrency: Practice and Experience 6 (1994) 505–516

    Article  Google Scholar 

  5. Rowstron, A., Wood, A.: Solving the Linda multiple rd problem. In Ciancarini, P., Hankin, C., eds.: Coordination Languages and Models, Proc. Coordination’ 96. Volume 1061 of Lecture Notes in Computer Science., Springer-Verlag (1996) 357–367

    Google Scholar 

  6. Campbell., D.: Constraint matching retrieval in Linda: extending retrieval functionality and distributing query processing. Technical Report YCS 285, University of York (1997)

    Google Scholar 

  7. Kielmann, T.: Objective Linda: A Coordination Model for Object-Oriented Parallel Programming. PhD thesis, University of Siegen, Germany (1997)

    Google Scholar 

  8. Kielmann, T.: Object-Oriented Distributed Programming with Objective Linda. In: First InternationalW orkshop on High Speed Networks and Open Distributed Platforms, St. Petersburg, Russia (1995)

    Google Scholar 

  9. Holvoet, T., Berbers, Y.: Reffective programmable coordination media. [23] 1236–1242

    Google Scholar 

  10. Holvoet, T.: An Approach for Open Concurrent Software Development. PhD thesis, Department of Computer Science, K.U.Leuven (1997)

    Google Scholar 

  11. Broadbery, P., Playford, K.: Using object-oriented mechanisms to describe Linda. In Wilson, G., ed.: Linda-Like Systems and Their Implementation. Technical Report 91–13. Edinburgh Parallel Computing Centre (1991) 14–26

    Google Scholar 

  12. Foster, M., Matlo., N., Pandey, R., Standring, D., Sweeney, R.: I-Tuples: A programmer-controllable performance enhancement for the Linda environment. [23] 357–361

    Google Scholar 

  13. Rowstron, A.: Mobile co-ordination: Providing fault tolerance in tuple space based co-ordination languages. URL: http://www.research.microsoft.com/~antr/-papers/mobile.ps.gz (1999)

  14. Sudell, A.: Design and implementation of a tuple-space server for Java. URL: http://www.op.net/~asudell/is/linda/linda.html (1998)

  15. Smith, A.: Towards wide-area network Piranha: Implementing Java-Linda. (URL: http://www.cs.yale.edu/homes/asmith/cs690/cs690.html)

  16. Carriero, N., Gelernter, D.: How to Write Parallel Programs: A First Course. The MIT Press (1990)

    Google Scholar 

  17. World Wide Web Consortium: Extensible markup language (XML). (URL: http://www.w3.org/XML)

  18. World Wide Web Consortium: XML Path language (XPath) version 1.0. W3C Recommendation, URL: http://www.w3.org/TR/xpath.html (1999)

  19. Freeman, E., Hupfer, S., Arnold, K.: JavaSpaces Principles, Patterns, and Practice. Addison-Wesley (1999)

    Google Scholar 

  20. Wells, G., Chalmers, A., Clayton, P.: A comparison of Linda implementations in Java. In Welch, P., Bakkers, A., eds.: Communicating Process Architectures 2000. Volume 58 of Concurrent Systems Engineering Series. IOS Press (2000) 63–75

    Google Scholar 

  21. Wells, G.: A Programmable Matching Engine for Application Development in Linda. PhD thesis, University of Bristol, U.K. (2001)

    Google Scholar 

  22. Arabnia, H., ed.: Proc. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’2001). CSREA Press (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rhodes University, 6140, Grahamstown, South Africa

    George Wells & Peter Clayton

  2. Department of Computer Science, University of Bristol, BS8 1UB, Bristol, UK

    Alan Chalmers

Authors
  1. George Wells
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Chalmers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Clayton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Software Engineering Department, Centre for Mathematics and Computer Science, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands

    Farhad Arbab

  2. SRI International, 333 Ravenswood Ave., 94025, Menlo Park, CA, USA

    Carolyn Talcott

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wells, G., Chalmers, A., Clayton, P. (2002). Extending the Matching Facilities of Linda. In: Arbab, F., Talcott, C. (eds) Coordination Models and Languages. COORDINATION 2002. Lecture Notes in Computer Science, vol 2315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46000-4_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-46000-4_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46000-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation