A register allocation framework based on hierarchical cyclic interval graphs
- 1 January 1992
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 176-191
- https://doi.org/10.1007/3-540-55984-1_17
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The priority-based coloring approach to register allocationACM Transactions on Programming Languages and Systems, 1990
- Spill code minimization techniques for optimizing compliersPublished by Association for Computing Machinery (ACM) ,1989
- Coloring heuristics for register allocationPublished by Association for Computing Machinery (ACM) ,1989
- Trapezoid graphs and their coloringDiscrete Applied Mathematics, 1988
- Interval graphs and related topicsDiscrete Mathematics, 1985
- Register allocation by priority-based coloringACM SIGPLAN Notices, 1984
- Register allocation & spilling via graph coloringPublished by Association for Computing Machinery (ACM) ,1982
- Register allocation via coloringComputer Languages, 1981
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- What Are the Intersection Graphs of Arcs in a Circle?The American Mathematical Monthly, 1969