This is a preview of subscription content, log in via an institution to check access.
References
Intel Corporation, “Intel Reference FORTRAN Compiler User's Guide for UNIX Systems,” Order number 484344-002.
David Callahan, Steve Carr, and Ken Kennedy, “Improving register allocation for subscripted variables,” Proceedings of the ACM SIGPLAN Symposium on Programming Language Design and Implementation, 1990.
Allan Porterfield, “Compiler management of program locality,” Rice COMP TR-88-63, January 1988.
Michael E. Wolf and Monica S. Lam, “A data locality optimizing algorithm,” Proceedings of the ACM SIGPLAN Symposium on Programming Language Design and Implementation, 1991.
Alvin R. Lebeck and David A. Wood, “Cache profiling and the SPEC benchmark: a case study,” Technical report, University of Wisconsin, March 1992.
F. E. Allen and J. Cocke, “A catalogue of optimizing transformations,” in Design and Optimization of Compilers, Prentice-Hall, 1972.
A. Aiken and A. Nicolau, “Loop quantization: an analysis and algorithm,” Technical report 87-821, Cornell U., March 1987.
D. Callahan, J. Cocke, and K. Kennedy, “Estimating interlock and improving balance for pipelined machines,” Journal of Parallel and Distributed Computing, 5, 1988.
M. Wolfe, “Advanced loop interchange,” Proceedings of the 1986 International Conference on Parallel Processing, August 1986.
J. R. Allen and K. Kennedy, “Automatic translation of Fortran programs to vector form,” ACM Transactions on Programming Languages and Systems, 9(4), October 1987.
M. Wolfe, “Iteration space tiling for memory hierarchies,” Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, December 1987.
A. K. Porterfield, “Software methods for improvement of cache performance on supercomputer applications,” Ph.D. thesis, Rice U., May 1989.
J. Ferrante, V. Sarkar, and W. Thrash, “On estimating and enhancing cache effectiveness,” in Fourth Workshop on Languages and Compilers for Parallel Computing, August 1991.
D. Gannon, W. Jalby, and K. Gallivan, “Strategies for cache and local memory management by global program transformations,” Proceedings of the First ACM International Conference on Supercomputing, June 1987.
U. Banerjee, Dependence Analysis for Supercomputing, Kluwer Academic Publishers, 1988.
U. Banerjee, Loop Transformations for Restructuring Compilers: The Foundations, Kluwer Academic Publishers, 1993.
U. Banerjee, Loop Transformations for Restructuring Compilers: Loop Parallelization, Kluwer Academic Publishers, 1994.
M. Wolfe, Optimizing Supercompilers for Supercomputers, MIT Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sridharan, K., Chang, P., Banerjee, U., Narayanaswamy, R., Rao, S. (1997). Memory optimizations in the Intel Reference Compiler. In: Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1996. Lecture Notes in Computer Science, vol 1239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017285
Download citation
DOI: https://doi.org/10.1007/BFb0017285
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63091-3
Online ISBN: 978-3-540-69128-0
eBook Packages: Springer Book Archive