GSpace : tailorable data distribution in shared data space systems

Abstract. The shared data space model has proven to be an effective paradigm for building distributed applications. However, building an efficient distributed implementation remains a challenge. A plethora of different implementations exists. Each of them has a specific policy for distributing data across nodes. Often, these policies are tailored to a specific application domain. Thus, those systems may often perform poorly with applications extraneous to their domain. In this paper, we propose that implementations of a distributed shared data space system should provide mechanisms for tailoring data distribution policies. Through this flexibility the shared data space system can cope with a wide spectrum of application classes. The need for this flexibility is illustrated by experiments which show that there is no single distribution policy that works well in all cases.

[1]  Henri E. Bal,et al.  Object distribution in Orca using Compile-Time and Run-Time techniques , 1993, OOPSLA '93.

[2]  Ken Arnold,et al.  JavaSpaces¿ Principles, Patterns, and Practice , 1999 .

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

[4]  Farhad Arbab,et al.  Coordination Models and Languages , 1998, Adv. Comput..

[5]  Dino Farinacci,et al.  PGM Reliable Transport Protocol Specification , 2001, RFC.

[6]  Franco Zambonelli,et al.  Strategies and protocols for highly parallel Linda servers , 1998 .

[7]  Franco Zambonelli,et al.  Strategies and Protocols for Highly Parallel Linda Servers , 1998, Softw. Pract. Exp..

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

[9]  Tobin J. Lehman,et al.  T Spaces , 1998, IBM Syst. J..

[10]  Andrew S. Tanenbaum,et al.  Dynamically Selecting Optimal Distribution Strategies for Web Documents , 2002, IEEE Trans. Computers.

[11]  Amy L. Murphy,et al.  LIME: Linda meets mobility , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[12]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[13]  Peter M. A. Sloot,et al.  The distributed ASCI Supercomputer project , 2000, OPSR.

[14]  Maarten van Steen,et al.  Customizable Data Distribution for Shared Data Spaces , 2003, PDPTA.

[15]  Ronaldo Menezes,et al.  Scalability in Linda-like Coordination Systems , 2001, Coordination of Internet Agents: Models, Technologies, and Applications.

[16]  Seif Haridi,et al.  Multicast in DKS(N, k, f) Overlay Networks , 2003, OPODIS.

[17]  Willy Zwaenepoel,et al.  Techniques for reducing consistency-related communication in distributed shared-memory systems , 1995, TOCS.

[18]  Franco Zambonelli,et al.  Mobile-Agent Coordination Models for Internet Applications , 2000, Computer.

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

[20]  Luis Moura Silva,et al.  On the design of Eilean: a Linda-like library for MPI , 1994, Proceedings Scalable Parallel Libraries Conference.

[21]  Franco Zambonelli,et al.  Coordination of Internet Agents , 2001, Springer Berlin Heidelberg.

[22]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.