An efficient distributed tuple space implementation for networks of workstations
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
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.
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.