IMPLEMENTING LINDA TUPLESPACE ON A DISTRIBUTED SYSTEM

Linda, a general purpose coordination language, has been used to make a language parallel. Based on a logically shared tuplespace, Linda pos es difficulties to be efficiently implemented on a distributed multipr ocessor system. This paper reports our approach to solve the problem: processors are divided into groups, and each group has a group manager to provide a local view of the global tuplespace, and handles the tup lespace operations incurred by processors within the group. To maintai n the consistency and correctness of the Linda tuplespace operations, we propose the algorithms of a group manager. We also implement the al gorithms on a transputer-based multicomputer and show the experiment r esults.