Extending the Matching Facilities of Linda

Authors:
George Wells;Alan Chalmers;Peter Clayton
Affiliations:
-;-;-
Venue:
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Year:
2002

Citing 7
Cited 2

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
How to write parallel programs: a first course

How to write parallel programs: a first course
JavaSpaces Principles, Patterns, and Practice

JavaSpaces Principles, Patterns, and Practice
Coordinating Web-Based Systems with Documents in XMLSpaces

CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Solving the LINDA Multiple rd Problem

COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Mobile Co-ordination: Providing Fault Tolerance in Tuple Space Based Co-ordination Languages

COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
T spaces

IBM Systems Journal

The LighTS tuple space framework and its customization for context-aware applications

Web Intelligence and Agent Systems
Introducing the concept of customizable structured spaces for agent coordination in the production automation domain

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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.