This paper demonstrates how this "multiple

Linda is a coordination language using generative communication via tuple spaces, which are global associative memories consisting of bags (or multi-sets) or tuples. The matching of tuples for retrieval has traditionally been undertaken using a simple matching algorithm: performing exact matching or variable substitutions on corresponding elements in a tuple and a tuple template. It is proposed here to generalise the matching process to effectively match according to any function that can be devised as a comparison between tuples. That is, constraint matching, where tuples are matched according to any given constraint. Constraint matching effectively moves processing from the user process to the individual retrieval instruction. In a distributed Linda environment this means a distribution of the processing associated with complex retrievals to the actual data, thus reducing communication and increasing performance. Simulations and emulations of constraint matching in the existing speci...

Abstract not found