Abstract
Efficient implementations of Linda must address two potentially expensive properties of tuple space: associative access and uncoupled communications. Current compile-time analyses have significantly reduced the cost of associative access to tuple space. We propose a set of new analyses that help tackle uncoupling, as well as establish a more general framework for optimizations. We relate these analyses to new optimization strategies and give example applications of the latter.
This research is supported by National Science Foundation grant CCR-8657615 and by the Air Force Office of Scientific Research under grant number AFOSR-91-0098
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Ahmed, N. Carriero, and D. Gelernter. The Linda Program Builder. In Proc. Third Workshop on Languages and Compilers for Parallelism, Irvine, 1990.
M. Burke and R. Cytron. Interprocedural depenedence analysis and parallelization. In Proc. of ACM SIGPLAN Symposium on Compiler Construction, pages 162–175. ACM, July 1986.
R. Bjornson. Linda on Distributed-Memory Multiprocessors. PhD thesis, Yale University Department of Computer Science, New Haven, Connecticut, 1991. Department of Computer Science.
N. Carriero and D. Gelernter. Linda in context. Commun. ACM, 32(4):444–458, Apr. 1989.
N. Carriero and D. Gelernter. How to Write Parallel Programs: A first course. MIT Press, Cambridge, 1990.
N. Carriero and D. Gelernter. Tuple analysis and partial evaluation strategies in the Linda pre-compiler. In D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing, pages 114–125. MIT Press, Cambridge, 1990.
N. Carriero, D. Gelernter, and J. Leichter. Distributed data structures in Linda. In Thirteenth ACM Symposium on Principles of Programming Languages Conf., pages 236–242, St. Petersburg, Florida, Jan. 1986. Association for Computing Machinery.
M. C. Chen. A parallel language and its compilation to multiprocessor machines or VLSI. In Thirteenth Annual ACM Symposium on Principles of Programming Languages, pages 131–139. Association for Computing Machinery, Jan. 1986.
D. Callahan and K. Kennedy. Compiling programs for distributed-memory multiprocessors. The Journal of Supercomputing, 2:151–169, 1988.
D. Gelernter. Generative communication in Linda. ACM Trans. Prog. Lang. Syst., 7(1):80–112, Jan. 1985.
V. Krishnaswamy. The Linda Machine. PhD thesis, Yale University Department of Computer Science, New Haven, Connecticut, 1991. Department of Computer Science (in preparation).
D. Padua and M. J. Wolfe. Advanced Compiler Optimizations for Supercomputers. Commun. ACM, 29(12):1184–1201, Dec. 1986.
E. Segall. In preparation. PhD thesis, Rutgers University, New Brunswick, New Jesey, 1991. CAIP.
N. Yang Wang. 690 project report. Report on preliminary thesis research., 1990.
H. Zima, H.-J. Bast, and M. Gerndt. SUPERB: A tool for semi-automatic MIMD/SIMD parallelization. Parallel Computing, 6:1–18, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carriero, N., Gelernter, D. (1992). A foundation for advanced compile-time analysis of linda programs. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1991. Lecture Notes in Computer Science, vol 589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038678
Download citation
DOI: https://doi.org/10.1007/BFb0038678
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55422-6
Online ISBN: 978-3-540-47063-2
eBook Packages: Springer Book Archive