Strategies and Protocols for Highly Parallel Linda Servers

The tuple space abstraction is a powerful and general coordination model for parallel and distributed programming. However, this model is based on the abstraction of a global space, difficult to implement in distributed memory parallel systems with high-performance and scalability. The paper discusses the possible distribution strategies to implement a tuple space server and proposes a new replication policy suitable for massively parallel systems. The proposed strategy achieves scalability by organising the system in a hierarchical way and by integrating coherence protocols of limited overhead. Moreover, the chosen organisation encourages the presence of multiple tuple spaces each with a constrained scope. The paper describes and analyses a transputer-based implementation: the hierarchical organisation of the tuple space makes the access time proportional to the locality of the references and bounded by the logarithm of the system size.  1998 John Wiley & Sons, Ltd.

[1]  Robert Tolksdorf.  Laura - A Service-Based Coordination Language , 1998, Sci. Comput. Program..

[2]  Franco Zambonelli,et al.  An Object-Oriented Approach to Structured Parallel Programming , 1997, Softw. Concepts Tools.

[3]  Bill Nitzberg,et al.  Distributed shared memory: a survey of issues and algorithms , 1991, Computer.

[4]  Andrea Omicini,et al.  An Extensible Frame work for the Development of Coordinated Applications , 1996, COORDINATION.

[5]  Fabrizio Baiardi,et al.  1993 International Conference on Parallel Processing P 3 M: A Virtual Machine Approach to Massively Parallel Computing (Extended Abstract) , 1993 .

[6]  James M. Purtilo,et al.  Reconfiguration of hierarchical tuple-spaces: experiments with Linda-Polylith , 1993 .

[7]  Paolo Ciancarini,et al.  Jada - Coordination and Communication for Java Agents , 1996, Mobile Object Systems.

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

[9]  Antony I. T. Rowstron,et al.  Solving the LINDA Multiple rd Problem , 1996, COORDINATION.

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

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

[12]  P. Stenstrom.  A survey of cache coherence schemes for multiprocessors , 1990, Computer.

[13]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[14]  Ralph Duncan,et al.  A survey of parallel computer architectures , 1990, Computer.

[15]  LINDA-POLYLITHGilberto Matos,et al.  RECONFIGURATION OF HIERARCHICAL TUPLE-SPACES : EXPERIMENTS WITH , 1993 .

[16]  Timothy G. Mattson.  The Efficiency of Linda for General Purpose Scientific Programming , 1994, Sci. Program..

[17]  Nicholas Carriero,et al.  Linda and Friends , 1986, Computer.

[18]  Ronald H. Perrott,et al.  Parallel programming , 1988, International computer science series.

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

[20]  Veljko M. Milutinovic,et al.  Distributed shared memory: concepts and systems , 1997, IEEE Parallel Distributed Technol. Syst. Appl..

[21]  Robert D. Bjornson.  Linda on distributed memory multiprocessors , 1993 .

[22]  Nicholas Carriero,et al.  The S/Net's Linda kernel , 1986, TOCS.

[23]  Franco Zambonelli,et al.  The impact of the coordination model in the design of mobile agent applications , 1998, Proceedings. The Twenty-Second Annual International Computer Software and Applications Conference (Compsac '98) (Cat. No.98CB 36241).

[24]  Salvatore Orlando,et al.  P3 L: A structured high-level parallel language, and its structured support , 1995, Concurr. Pract. Exp..

[25]  D. Skillicom.  Architecture-independent parallel computation , 1990 .

[26]  SpaceSystemsRonaldo,et al.  Garbage Collection in Open Distributed Tuple , 1997 .

[27]  Oswald Drobnik,et al.  Mobile Agent Interaction in Heterogeneous Environments , 1997, Mobile Agents.

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

[29]  Ramesh Subramonian,et al.  LogP: a practical model of parallel computation , 1996, CACM.

[30]  Franco Zambonelli,et al.  A scalable tuple space model for structured parallel programming , 1995, Programming Models for Massively Parallel Computers.

[31]  Yike Guo,et al.  Parallel skeletons for structured composition , 1995, PPOPP '95.

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

[33]  Lori Pollock,et al.  Issues and experiences in implementing a distributed tuplespace , 1997 .

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