Abstract
Compiling programs to use parallelism and memory hierarchy efficiently requires both parallelizing (high-level) transformations and traditional scalar (low-level) optimizations. Our compiler has only one intermediate language — SUIF (Stanford University Intermediate Form) — for both parallelization and scalar optimizations. Having only one intermediate language offers two advantages: no duplication of functions between the two levels, and availability of high-level information at the low-level. This paper shows how SUIF integrates the two levels of abstraction, and how the SUIF compiler is organized to take advantage of this integration.
This research was supported in part by DARPA contract N00014-87-K-0828.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: principles techniques, and tools. Addison-Wesley, 1988.
F. E. Allen, J. L. Carter, J. Fabri, J. Ferrante, W. H. Harrison, P. G. Loewner, and L. H. Trevillyan. The experimental compiling system. IBM Journal of Research and Development, 24(6), November 1980.
M. Auslander and M. Hopkins. An overview of the PL.8 compiler. In SIGPLAN Conference on Compiler Construction, 1982.
U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic, 1988.
F. C. Chow. A Portable Machine-Independent Global Optimizer — Design and Measurement. PhD thesis, Stanford University, 1983.
D. S. Coutant Retargetable high-level alias analysis. In Proceedings of the 13th ACM Symposium on Principles of Programming Languages, 1986.
M. Ganapathi, C. N. Fischer, and J. L. Hennessy. Retargetable compiler code generation. ACM Computing Surveys, 14(4):573–592, 1982.
D. Gay. Private communication. ATT Software, 1988.
W. Harrison. A new strategy for code generation — the general purpose optimizing compiler. In ACM Fourth Symposium on Principles of Programming Languages, pages 29–37, 1977.
D. E. Maydan, J. L. Hennessy, and M. S. Lam. Efficient andb exact data dependence testing. In SIGPLAN Conference on Programming Language Design and Implementation, June 1991.
D. L. Perkins and R. L. Sites. Machine-independent pascal code optimization. In Proceedings of the SIGPLAN Symposium on Compiler Construction, pages 201–207, 1979.
S. W. K. Tjiang. Sharlit: A tool for scalar optimizers. Expected, 1991.
M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In SIGPLAN Conference on Programming Language Design and Implementation, 1991.
M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Transactions on Parallel and Distributed Systems, Oct 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tjiang, S., Wolf, M., Lam, M., Pieper, K., Hennessy, J. (1992). Integrating scalar optimization and parallelization. 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/BFb0038662
Download citation
DOI: https://doi.org/10.1007/BFb0038662
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