DMCA
Live Range Splitting in a Graph Coloring Register Allocator (1998)
Cached
Download Links
- [softlib.cs.rice.edu]
- [ece.colorado.edu]
- [ecee.colorado.edu]
- [ecee.colorado.edu]
- [ecee.colorado.edu]
- DBLP
Other Repositories/Bibliography
by
Keith D. Cooper
,
L. Taylor Simpson
| Citations: | 26 - 4 self |
BibTeX
@MISC{Cooper98liverange,
author = {Keith D. Cooper and L. Taylor Simpson},
title = {Live Range Splitting in a Graph Coloring Register Allocator},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph to model the conflicts that prevent two values from sharing a register. Nodes in the graph represent live ranges, or values. An edge between two nodes indicates that they are simultaneously live and, thus, cannot share a register.
