Solving the Linda Multiple rd Problem Using the Copy-Collect Primitive

Abstract Linda is a mature co-ordination language that has been in use for several years. However, as a result of recent work on the model we have found a simple class of operation that is widely used in many different algorithms which the Linda model is unable to express in a viable fashion. An example algorithm which uses this operation is the composition of two binary relations. By examining how to implement this in parallel using Linda we demonstrate that the approaches possible using the current Linda primitives are unsatisfactory. This paper demonstrates how this “multiple rd problem” can be overcome by the addition of a primitive to the Linda model, copy-collect. This builds on previous work on another primitive called collect (Butcher et al., 1994). The parallel composition of two binary relations using the copy-collect primitive can be achieved with maximal parallelism.

[1]  Alan Wood,et al.  An e cient distributed tuple space implementation for networks of heterogenous workstations , 1996 .

[2]  Antony I. T. Rowstron,et al.  An Efficient Distributed Tuple Space Implementation for Networks of Workstations , 1996, Euro-Par, Vol. I.

[3]  Dennis Shasha,et al.  Persistant Linda: Linda + Transactions + Query Processing , 1991, Research Directions in High-Level Parallel Programming Languages.

[4]  Roberto Gorrieri,et al.  Towards a calculus for generative communication , 1997 .

[5]  Antony Ian Taylor Rowstron,et al.  Bulk primitives in Linda run-time systems , 1996 .

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

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

[8]  Andrew Douglas,et al.  ISETL-LINDA: Parallel Programming with Bags , 1995 .

[9]  Rocco De Nicola,et al.  A Process Algebra Based on LINDA , 1996, COORDINATION.

[10]  Martin Rem,et al.  PARLE '89 Parallel Architectures and Languages Europe , 1989, Lecture Notes in Computer Science.

[11]  Paul Butcher.  A behavioural semantics for Linda-2 , 1991, Softw. Eng. J..

[12]  Thilo Kielmann,et al.  Designing a Coordination Model for Open Systems , 1996, COORDINATION.

[13]  Karpjoo Jeong,et al.  Fault-tolerant Parallel Processing Combining Linda, Checkpointing, and Transactions , 1996 .

[14]  Alan Wood,et al.  Implementing mathematical morphology in ISETL-LINDA , 1995 .

[15]  Oscar Nierstrasz,et al.  Object-Based Models and Languages for Concurrent Systems , 1994, Lecture Notes in Computer Science.

[16]  Paolo Ciancarini,et al.  On the Operational Sematics of a Coordination Language , 1994, ECOOP Workshop.

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

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

[19]  Wilhelm Hasselbring,et al.  Prototyping parallel algorithms in a set-oriented language , 1994 .