This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, et. al., Compilers: Principles, Techniques and Tools, Addison Wesley, Massachusetts, 1986.
J. Bruno and B. Szymanski, “Conditional Data Dependence Analysis in an Equational Language Compiler,” Proceedings of the Third International Conference on Supercomputing Systems, Boston, MA, May 1988, pp. 358–365.
J. Bruno, “Analyzing Conditional Data Dependencies in an Equational Language Compiler,” Ph.D. thesis, RPI, Troy, NY, 1989.
M. Burke and R. Cytron, “Interprocedural Dependence Analysis and Parallelization,” Proceedings of the SIGPLAN 1986 Symposium on Compiler Construction, ACM SIGPLAN Notices, Vol. 21, No. 7, July 1986, pp. 162–175.
M. Burke, et al., “Automatic Discovery of Parallelism: A Tool and an Experiment,” ACM/SIGPLAN PPEALS 1988, ACM SIGPLAN Notices, Vol. 23, No. 9, September 1988, pp. 77–84.
K. Cooper, et. al., “Interprocedural Optimization: Eliminating Unnecessary Recompilation,” Proceedings of the SIGPLAN 1986 Symposium on Compiler Construction, ACM SIGPLAN Notices, Vol. 21, No. 7, July 1986, pp. 58–67.
K. Cooper, et. al., “The Impact of Interprocedural Analysis and Optimization in the Rn Programming Environment,” ACM Transactions on Programming Languages and Systems, Vol. 8, No. 4, October 1986, pp. 491–523.
J. Ferrante, et. al., “The Program Dependence Graph and Its Use in Optimization,” ACM Transactions on Programming Languages and Systems, Vol. 9, No. 3, July 1987, pp. 319–349.
C.A.R. Hoare, “Communicating Sequential Processes,” CACM, Vol. 21, No. 8, August 1978, pp. 666–677.
D. Kuck, et. al., “On the Number of Operations Simultaneously Executable in Fortran-like Programs and Their Resulting Speedup,” IEEE Transactions on Computers, Vol. 21, No. 12, December 1972, pp. 1293–1310.
D. Kuck, et. al., “Dependence Graphs and Compiler Optimizations,” Conference Record of the 8th Annual ACM Symposium on Principles of Programming Languages, January 1981, pp. 207–218.
M. Maekawa, et. al., Operating Systems-Advanced Concepts, Benjamin/Cummings, Massachusetts, 1987, page 105.
D. Padua and M. Wolfe, “Advanced Compiler Optimizations for Supercomputers,” CACM, Vol. 29, No. 12, December 1986, pp. 1164–1201.
V. Sarkar and J. Hennessy, “Compile-time Partitioning and Scheduling of Parallel Programs,” Proceedings of the SIGPLAN 1986 Symposium on Compiler Construction, ACM SIGPLAN Notices, Vol. 21, No. 7, July 1986, pp. 17–26.
Y. Shi, et. al., “Very High Level Concurrent Programming,” IEEE Transactions on Software Engineering, Vol. SE-13, No. 9, September 1987, pp. 1038–1046.
B. Szymanski, “Parallel Programming with Recurrent Equations,” International Journal of Supercomputing Applications, Vol. 1, No. 2, pp. 44–74, 1987.
B. Szymanski (editor), Parallel Functional Programming: Languages and Environments (A Comparative Study), ACM Press, 1991 (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spier, K.L., Szymanski, B.K. (1990). Interprocess analysis and optimization in the equational language compiler. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_111
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_111
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive