Extending the Matching Facilities of Linda

  • George Wells
  • Alan Chalmers
  • Peter Clayton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2315)


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.


Tuple Space Matching Operation Coordination Language Input Operation Coordination Operation 
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. 1.
    Gelernter, D.: Generative communication in Linda. ACM Trans. Programming Languages and Systems 7 (1985) 80–112zbMATHCrossRefGoogle Scholar
  2. 3.
    Wycko., P., McLaughry, S.W., Lehman, T.J., Ford, D.A.: T Spaces. IBM Systems Journal 37 (1998) 454–474CrossRefGoogle Scholar
  3. 4.
    Tolksdorf, R., Glaubitz, D.: Coordinating web-based systems with documents in XMLSpaces. URL:
  4. 5.
    Butcher, P., Wood, A., Atkins, M.: Global synchronisation in Linda. Concurrency: Practice and Experience 6 (1994) 505–516CrossRefGoogle Scholar
  5. 6.
    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–367Google Scholar
  6. 7.
    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. 8.
    Kielmann, T.: Objective Linda: A Coordination Model for Object-Oriented Parallel Programming. PhD thesis, University of Siegen, Germany (1997)Google Scholar
  8. 9.
    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. 10.
    Holvoet, T., Berbers, Y.: Reffective programmable coordination media. [23] 1236–1242Google Scholar
  10. 11.
    Holvoet, T.: An Approach for Open Concurrent Software Development. PhD thesis, Department of Computer Science, K.U.Leuven (1997)Google Scholar
  11. 12.
    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–26Google Scholar
  12. 13.
    Foster, M., Matlo., N., Pandey, R., Standring, D., Sweeney, R.: I-Tuples: A programmer-controllable performance enhancement for the Linda environment. [23] 357–361Google Scholar
  13. 14.
    Rowstron, A.: Mobile co-ordination: Providing fault tolerance in tuple space based co-ordination languages. URL: (1999)
  14. 15.
    Sudell, A.: Design and implementation of a tuple-space server for Java. URL: (1998)
  15. 16.
    Smith, A.: Towards wide-area network Piranha: Implementing Java-Linda. (URL:
  16. 17.
    Carriero, N., Gelernter, D.: How to Write Parallel Programs: A First Course. The MIT Press (1990)Google Scholar
  17. 18.
    World Wide Web Consortium: Extensible markup language (XML). (URL:
  18. 19.
    World Wide Web Consortium: XML Path language (XPath) version 1.0. W3C Recommendation, URL: (1999)
  19. 20.
    Freeman, E., Hupfer, S., Arnold, K.: JavaSpaces Principles, Patterns, and Practice. Addison-Wesley (1999)Google Scholar
  20. 21.
    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–75Google Scholar
  21. 22.
    Wells, G.: A Programmable Matching Engine for Application Development in Linda. PhD thesis, University of Bristol, U.K. (2001)Google Scholar
  22. 23.
    Arabnia, H., ed.: Proc. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’2001). CSREA Press (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • George Wells
    • 1
  • Alan Chalmers
    • 2
  • Peter Clayton
    • 1
  1. 1.Department of Computer ScienceRhodes UniversityGrahamstownSouth Africa
  2. 2.Department of Computer ScienceUniversity of BristolBristolUK

Personalised recommendations