Issues and experiences in implementing a distributed tuplespace

✍ Scribed by James B. Fenwick Jr.; Lori L. Pollock

• Book ID: 101239669
• Publisher: John Wiley and Sons
• Year: 1997
• Tongue: English
• Weight: 238 KB
• Volume: 27
• Category: Article
• ISSN: 0038-0644
• DOI: 10.1002/(sici)1097-024x(199710)27:10<1199::aid-spe127>3.0.co;2-u

✦ Synopsis

Distributed memory multiprocessors and network clusters are being used increasingly as parallel computing resources due to their scalability and cost/performance advantages. However, it is generally believed that shared memory parallel programming is easier than explicit message passing programming. Although the generative communication model provides scalability like message passing and the simplicity of shared memory programming, it is a challenge to effectively implement this model on machines with physically distributed memories. This paper describes the issues involved in implementing the essential component of generative communication, the shared data space abstraction called tuplespace, on a distributed memory machine. The paper gives a detailed description of Deli, a UNIX-based distributed tuplespace implementation for a network of workstations. This description, along with discussions of implementation alternatives, provides a detailed basis for designers and implementors of shared data spaces, not currently available in the literature. ©1997 by John Wiley & Sons, Ltd.