Improving register allocation for subscripted variables
Document Type
Conference Proceeding
Publication Date
4-1-2004
Abstract
Different ways to improve the register allocation for subscripted variables are discussed. An algorithm and experiment for a loop transformation called scalar replacement that exposed the reuse available in array references in an innermost loop is addressed. The approach led to the improvements in the performance of scientific programs on machines with long memory latencies. The major influences that resulted in the development of scalar replacement and unroll-and-jam are also reviewed.
Publication Title
ACM SIGPLAN Notices
Recommended Citation
Callahan, D.,
Carr, S.,
&
Kennedy, K.
(2004).
Improving register allocation for subscripted variables.
ACM SIGPLAN Notices,
39(4), 328-329.
http://doi.org/10.1145/989393.989428
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/12615