Optimization of distributed communication in multiprotocol Tuple Space

Tuple Space provides primitives convenient for description of data-sharing and interprocess communication, but its implementation on distributed systems is less efficient than that on shared memory machines. Multiprotocol Tuple Space improves the implementation on distributed systems. That provides three replication-consistency protocols that are weakened to different degrees. By selecting these protocols according to communication patterns, communication through Tuple Space can be optimized.<<ETX>>

[1]  Mustaque Ahamad,et al.  Slow memory: weakening consistency to enhance concurrency in distributed shared memories , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[2]  Henri E. Bal,et al.  Distributed Programming with Shared Data , 1991, Comput. Lang..

[3]  William Leler,et al.  Linda meets Unix , 1990, Computer.

[4]  Satoshi Matsuoka,et al.  Using tuple space communication in distributed object-oriented languages , 1988, OOPSLA 1988.

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

[6]  Takashi Masuda,et al.  A comprehensive-based database language and its distributed execution , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[7]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.