COPY-COLLECT: A New Primitive for the Linda Model

Linda is a model of communication for concurrent processes. This paper proposes the addition of a new primitive to the Linda model, called copy-collect. An informal semantics of the new primitive is presented and an outline of the multiple rd problem which provides the justi cation for adding a new primitive. A description of how the new primitive can be implemented on several di erent implementations is also provided.

[1]  Nicholas Carriero,et al.  Linda in context , 1989, CACM.

[2]  Craig Faasen.  Intermediate Uniformly Distributed Tuple Space on Transputer Meshes , 1991, Research Directions in High-Level Parallel Programming Languages.

[3]  Paul Butcher,et al.  Global synchronisation in Linda , 1994, Concurr. Pract. Exp..

[4]  David Gelernter,et al.  Multiple Tuple Spaces in Linda , 1989, PARLE.

[5]  A. Rowstron,et al.  Linda Implementation Revisited , 1995 .

[6]  Nicholas Carriero,et al.  Matching Language and Hardware for Parallel Computation in the Linda Machine , 1988, IEEE Trans. Computers.

[7]  Nicholas Carriero,et al.  How to write parallel programs - a first course , 1990 .