Improving register allocation for subscripted variables

ACM SIGPLAN Notices

Volumn 39, Issue 4, 2004, Pages 328-329

  Callahan, David ^a   Carr, Steve ^b   Kennedy, Ken ^c  

^a CRAY INC   (United States)

^b Michigan Technological University   (United States)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLELISM; REGISTER ALLOCATION; SCALAR REPLACEMENT; VECTOR REGISTERS;

DATA FLOW ANALYSIS; DATA REDUCTION; DATA STORAGE EQUIPMENT; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; STRATEGIC PLANNING;

STORAGE ALLOCATION (COMPUTER);

EID: 3142766244     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/989393.989428     Document Type: Conference Paper

References (28)

1. W. Abu-Sufah. Improving the Performance of Virtual Memory Computers. PhD thesis, University of Illinois, 1978.
2. F. E. Allen and J. Cocke. A catalogue of optimizing transformations. In Design and Optimization of Compilers, pages 1-30. Prentice-Hall, 1972.
3. J. Allen, D. Callahan, and K. Kennedy. Automatic decomposition of scientific programs for parallel execution. In Conference Record of the Fourteenth ACM Symposium on the Principles of Programming Languages, Munich, West Germany, Jan. 1987.
4. J. Allen and K. Kennedy. Automatic translation of Fortran programs to vector form. ACM Transactions on Programming Languages and Systems, 9(4):491-542, Oct. 1987.
5. J. Allen and K. Kennedy. Vector register allocation. IEEE Transactions on Computers, 41(10):1290-1317, Oct. 1992.
6. P. Briggs, K. D. Cooper, K. Kennedy, and L. Torczon. Coloring heuristics for register allocation. In Proceedings of the ACM SIGPLAN '89 Conference on Programming Language Design and Implementation, pages 275-284, Portland, OR, July 1989.
7. D. Callahan, J. Cocke, and K. Kennedy. Estimating interlock and improving balance for pipelined machines. Journal of Parallel and Distributed Computing, 5:334-358, 1988.
8. S. Carr. Combining optimization for cache and instruction-level parallelism. In Proceedings of the 1996 Conference on Parallel Architectures and Compiler Techniques, pages 238-247, Boston, MA, Oct. 1996.
9. th International Symposium on Microarchitecture (MICRO-30), Research Triangle Park, NC, Dec. 1997.
10. S. Carr and K. Kennedy. Improving the ratio of memory operations to floating-point operations in loops. ACM Transactions on Programming Languages and Systems, 16(6):1768-1810, 1994.
11. S. Carr and K. Kennedy. Scalar replacement in the presence of conditional control flow. Software - Practice & Experience, 24(1):51-77, Jan. 1994.
12. G. Chaitin, M. Auslander, A. Chandra, J. Cocke, M. Hopkins, and P. Markstein. Register allocation via coloring. Computer Languages, 6:45-57, Jan. 1981.
13. G. J. Chaitin. Register allocation and spilling via graph coloring. In Proceedings of the ACM SIGPLAN '82 Symposium on Compiler Construction, pages 98-105, Boston, MA, June 1982.
14. F. C. Chow and J. L. Hennessy. Register allocation by priority-based coloring. In Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction, pages 222-232, Montreal, Quebec, June 1984.
15. K.-H. Drechsler and M. P. Stadel. A solution to a problem with Morel and Renvoise's "Global optimization by suppression of partial redundancies". ACM Transactions on Programming Languages and Systems, 10(4):635-640, Oct. 1988.
16. E. Duesterwald, R. Gupta, and M. L. Soffa. A practical data flow framework for array reference analysis and its use in optimizations. In Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 68-77, Albuquerque, NM, June 1993.
17. D. Kuck, R. Kuhn, B. Leasure, and M. Wolfe. The structure of an advanced retargetable vectorizer. In Supercomputers: Design and Applications, pages 163-178. IEEE Computer Society Press, Silver Spring, MD., 1984.
18. D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe. Dependence graphs and compiler optimizations. In Conference Record of the Eight ACM Symposium on the Principles of Programming Languages, 1981.
19. D. Kuck, Y. Muraoka, and S. Chen. On the number of operations simultaneously executable in fortran-like programs and their resulting speedup. IEEE Transactions on Computers, C-21(12):1293-1310, Dec. 1972.
20. L. Lamport. The parallel execution of DO-loops. Communications of the ACM, 17(2):83-93, 1974.
21. K. S. McKinley, S. Carr, and C.-W. Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems, 18(4):424-453, 1996.
22. D. A. Padua and M. J. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29(12):1184-1201, Dec. 1986.
23. Y. Qian, S. Carr, and P. Sweany. Optimizing loop performance for clustered vliw architectures. In Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques, pages 271-280, Charlottesville, VA, Sept. 2002.
24. V. Sarkar. Optimized unrolling of nested loops. In Proceedings of the 2000 International Conference on Supercomputing, pages 153-166, Sante Fe, NM, May 2000.
25. M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 30-44, Toronto, Ontario, June 1991.
26. M. E. Wolf, D. E. Maydan, and D.-K. Chen. Combining loop transformations considering caches and scheduling. In Twenty-Ninth Annual Symposium on Micorarchitecture (MICRO-29), Dec. 1996.
27. M. Wolfe. Advanced loop interchange. In Proceedings of the 1986 International Conference on Parallel Processing, Aug. 1986.
28. M. Wolfe. Loop skewing: The wavefront method revisited. Journal of Parallel Programming, 15(4):279-293, Aug. 1986.