A Register Allocation Framework Based on Hierarchical Cyclic Interval Graphs


In this paper, we propose the use of cyclic interval graphs as an alternative representation for register allocation. The \thickness" of the cyclic interval graph captures the notion of overlap between live ranges of variables relative to each particular point of time in the program execution. We demonstrate that cyclic interval graphs provide a feasible… (More)
DOI: 10.1007/3-540-55984-1_17



Citations per Year

149 Citations

Semantic Scholar estimates that this publication has 149 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics