Estimating register cost using spots
Resource
TENCON '92. Technology Enabling Tomorrow : Computers, Communications and Automation towards the 21st Century. 1992 IEEE Region 10 International Conference.
Journal
TENCON '92. Technology Enabling Tomorrow : Computers, Communications and Automation towards the 21st Century. 1992 IEEE Region 10 International Conference
Pages
-
Date Issued
1992-11
Date
1992-11
Author(s)
DOI
N/A
Abstract
A modified register allocation algorithm whose register cost uses distinct spots is introduced. With this method, the five range of a variable can be viewed as a collection of spots, which are coordinate distances. Together with the usage counts of a variable and the increased weight on variables in loop structures, the cost of each variable already in a register is estimated. In the case where a spill is unavoidable, a variable in a register with minimum cost is chosen. Primary results show that this method increases speed about 21% in terms of the number of load/store instructions when compared with Chow's graph-coloring method. © 1992 IEEE.
Other Subjects
Graph colorings; Loop structure; Minimum cost; Register allocation; Cost estimating
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00271975.pdf
Size
399.15 KB
Format
Adobe PDF
Checksum
(MD5):25021b07bb6e0ab5977773b8359a65f8