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.
- 1.Gelemter, D., "Dynamic global name spaces on network computers", Proceedings of International Conference on Parallel Processing, August 1984, pp. 25-31.Google Scholar
- 2.Gelernter, D., Carriero, N., Chang, S., "Parallel Programruing in Linda", Proceedings of the 1985 Int. Conf. on Parallel Processing, pp. 255-263.Google Scholar
- 3.Gelernter, D., "Generative Communication ha Linda", ACM Transactions on Programming Languages and Systems, Vol. 7, No. 1, January 1985, pp. 80-112. Google ScholarDigital Library
- 4.Gelernter, D., Bernstein, "Distributed Communication via Global Buffer", Proceedings of ACM Syrup. on Principles of Distributed Computing, August 1982, pp. 10-18. Google ScholarDigital Library
- 5.Gelemter, D., Carriero, N., "The S/Net's Linda Kernel", ACM Transactions on Computer Systems, Vol. 4, No. 2, May 1986, pp. 110-129. Google ScholarDigital Library
- 6.Carriero, N., Gelernter, N., Leichter, J., "Distributed Data Structures ha Linda", Proceedings Syrup. on Programruing Languages, January 1986, pp. 236-242. Google ScholarDigital Library
- 7.Ahuja, S., Carriero, N., Gelemter, D., "Linda and Friends", IEEE Computer, Vol. 19, No. 8, August 1986. Google ScholarDigital Library
- 8.Carriero, N., Gelernter, D., "How to Write Parallel Programs: A Guide to the Perplexed", Research Report, Yale University, May 1988.Google Scholar
- 9.Carriero, N., "Implementation of Tuple Space Machines", Doctoral Dissertation, Yale University, December 1987. Google ScholarDigital Library
- 10.Gelemter, D., Carriero, N., "Applications Experience with Linda", Proceedings of ACM Syrup. on Parallel Programming, July 1988. Google ScholarDigital Library
- 11.Metcalfe, R. M., Boggs, D. R., "Ethernet: Distributed Packet Switching for Local Computer Networks", Communications of the ACM 25th Ann. Issue, Vol. 26, No. 1, January 1983. Google ScholarDigital Library
- 12.Dijkstra, E. W., "Cooperating Sequential Processes", Programming Languages, ed. Genuys, Academic Press, 1968, pp. 43-112.Google Scholar
- 13.Hoare, C.A.R., "Monitors: An Operating System Structurhag Concept", Communications of the ACM, Vol. 17, October 1974, pp. 549-557. Google ScholarDigital Library
- 14.Brinch Hansen, Per, "Distributed Processes: A Concurrent Programming Concept", Communications of the ACM, Vol. 21, No. 11, November 1978. Google ScholarDigital Library
- 15.McJones, Paul R., Swart, Garret F., "Evolving the UNIX System Interface to Support Multithreaded Programs", Digital Equipment Corporation Systems Research Center Report Number 21, September 1987.Google Scholar
- 16.Andrews, Gregory R., Olsson, Ronald A., "An Overview of the SR Language and Implementation", TR 86-6c Univ. of Arizona, October 1987.Google Scholar
- 17.Andrews, Gregory R., Olsson, Ronald A., "Revised Report on the SR Language", TR 87-27 Univ. of Arizona, November 1987.Google Scholar
- 18.Comer, Douglas, Internetworking with TCP/IP: Principles, Protocols, and Architecture, Prentice Hall, 1988 Google ScholarDigital Library
- 19.Holbach, James H., "A Portable Multi-tasking Kernel for Use with the UNIX Operating System",Wright State University Master's Thesis, January 1988.Google Scholar
- 20.Sun Microsystems, Networking on the Sun Workstation, IPC Primer, February 1986.Google Scholar
- 21.Kernighan, Brian W., Ritohie, Dennis, M., The C Programming Language, Prentice-Hall Software Series, London, 1978. Google ScholarDigital Library
- 22.Raynal, Michel, Distributed Algorithms and Protocols, John Wiley & Sons, 1988. Google ScholarDigital Library
- 23.EXCELAN, EXOS 8012-01 TCP/IP Network Software Reference Manual, December 1986.Google Scholar
- 24.Katseff, Howard P., "Using Data Partitioning to Implement a Parallel Assembler", Proceeding of the ACM/S1GPLAN PPEAI2, Vol. 23, No. 9, September 1988, pp. 66-76. Google ScholarDigital Library
Index Terms
- A parallel `make' utility based on Linda's tuple-space
Recommendations
Efficient Parallel Programming with Linda
Linda is a coordination language inverted by David Gelernter at Yale University, which when combined with a computation language (like C) yields a high-level parallel programming language for MIMD machines. Linda is based on a virtual shared associative ...
Utility Analysis of Parallel Simulation
PADS '03: Proceedings of the seventeenth workshop on Parallel and distributed simulationParallel computers are used to execute discrete-event simulations in contexts where a serial computer is unable to provide answers fast enough, and/or is unable to hold the simulation state in memory. Traditional research in parallel simulation has ...
Comments