A parallel `make' utility based on Linda's tuple-space

Authors:
C. J. Fleckenstein;D. Hemmendinger
Affiliations:
Wright State University, Department of Computer Science and Engineering;Wright State University, Department of Computer Science and Engineering
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 14
Cited 0

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
The C programming language

The C programming language
Linda and Friends

Computer
Internetworking with TCP/IP: principles, protocols, and architecture

Internetworking with TCP/IP: principles, protocols, and architecture
Distributed algorithms and protocols

Distributed algorithms and protocols
Using data partitioning to implement a parallel assembler

PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Applications experience with Linda

PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
The S/Net's Linda kernel

ACM Transactions on Computer Systems (TOCS)
Ethernet: distributed packet switching for local computer networks

Communications of the ACM - Special 25th Anniversary Issue
Distributed processes: a concurrent programming concept

Communications of the ACM
Monitors: an operating system structuring concept

Communications of the ACM
Distributed data structures in Linda

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Distributed communication via global buffer

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Implementation of tuple space machines

Implementation of tuple space machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a prototype of a parallel `make' utility that executes on multiple workstations and achieves a significant real-time speedup. This utility is implemented by means of logically shared memory based on the Linda system's tuple space. It makes work with distributed computing easy to conduct, since it can be built on top of an existing operating systems without modifying it, and since it permits easy experimentation with strategies for distributing the work.