Loading...
Please wait, while we are loading the content...
Similar Documents
Load/Store Range Analysis for Global Register Allocation (1994)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kolte, Priyadarshan Harrold, Mary Jean |
| Description | Live range splitting techniques improve global register allocation by splitting the live ranges of variables into segments that are individually allocated registers. Load/store range analysis is a new technique for live range splitting that is based on reaching definition and live variable analyses. Our analysis localizes the profits and the register requirements of every access to every variable to provide a fine granularity of candidates for register allocation. Experiments on a suite of C and FORTRAN benchmark programs show that a graph coloring register allocator operating on load/store ranges often provides better allocations than the same allocator operating on live ranges. Experimental results also show that the computational cost of using load/store ranges for register allocation is moderately more than the cost of using live ranges. 1 Introduction Register allocation maps variables in an intermediate language program to either registers or memory locations in order to minimiz... |
| File Format | |
| Language | English |
| Publisher | ACM |
| Publisher Date | 1994-01-01 |
| Publisher Institution | Proc. of the SIGPLAN Conference on Programming Language Design and Implementation |
| Access Restriction | Open |
| Subject Keyword | Memory Location Live Range Intermediate Language Program Allocated Register Register Requirement Register Allocation Computational Cost Load Store Range Analysis Fortran Benchmark Program Global Register Allocation Introduction Register Allocation Map Variable Live Range Splitting Live Variable Analysis Experimental Result Load Store New Technique Register Allocator Fine Granularity |
| Content Type | Text |
| Resource Type | Article |
