An efficient distributed tuple space implementation for networks of workstations

Abstract

In this paper an overview of a novel run time system for the management of tuple spaces, which utilises implicit information about tuple space use in Linda programs to maximise its performance. The approach is novel compared to other tuple space implementations because they either ignore the information, or expect the programmer to provide the information explicitly. A number of experimental results are given to demonstrate the advantages of using the our approach.