Results 1 -
2 of
2
Live Range Splitting in a Graph Coloring Register Allocator
, 1998
"... 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 a ..."
Abstract
-
Cited by 22 (3 self)
- Add to MetaCart
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.
CS 406/534 Compiler Construction Optimization and Global Register Allocation
"... Part of the course lecture notes are based on Prof. Keith Cooper, Prof. Ken Kennedy and Dr. Linda Torczon’s teaching materials at Rice University. All rights reserved. Today’s Goals � Introduction to optimization ..."
Abstract
- Add to MetaCart
Part of the course lecture notes are based on Prof. Keith Cooper, Prof. Ken Kennedy and Dr. Linda Torczon’s teaching materials at Rice University. All rights reserved. Today’s Goals � Introduction to optimization
