Results 1 - 3 of 3

Approaches to Enhance Graph Coloring Register Allocation

by Hongbo Yang Weiping, Hongbo Yang, Weiping Hu, Ruliang Qiao, Zhaoqing Zhang - In Proceedings of 1998 International Symposium for Future Software Technology (ISFST’98 , 1998
"... The relationship between run-time performance and effective use of a machine's register set is well understood. Graph coloring method, which pioneered by Chaitin, has been widely practiced. In this paper, we describe three improvements to Chaitin-style graph coloring register allocators. The fi ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
The relationship between run-time performance and effective use of a machine's register set is well understood. Graph coloring method, which pioneered by Chaitin, has been widely practiced. In this paper, we describe three improvements to Chaitin-style graph coloring register allocators

Spill Code Minimization via Interference Region Spilling

by Peter Bergner, Peter Dahl, David Engebretsen, Matthew O'Keefe - in SIGPLAN Conference on Programming Language Design and Implementation , 1997
"... Many optimizing compilers perform global register allocation using a Chaitin-style graph coloring algorithm. Live ranges that cannot be allocated to registers are spilled to memory. The amount of code required to spill the live range depends on the spilling heuristic used. Chaitin's spilling he ..."
Abstract - Cited by 41 (1 self) - Add to MetaCart
Many optimizing compilers perform global register allocation using a Chaitin-style graph coloring algorithm. Live ranges that cannot be allocated to registers are spilled to memory. The amount of code required to spill the live range depends on the spilling heuristic used. Chaitin's spilling

Call-Cost Directed Register Allocation

by Guei-yuan Lueh, Thomas Gross - In Proc. ACM SIGPLAN '97 Conf. on Prog. Language Design and Implementation , 1997
"... Choosing the right kind of register for a live range plays a major role in eliminating the register-allocation overhead when the compiled function is frequently executed or function calls are on the most frequently executed paths. Picking the wrong kind of register for a live range incurs a high pen ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
penalty that may dominate the total overhead of register allocation. In this paper, we present three improvements, storage-class analysis, benefit-driven simplification, and preference decision that are effective in selecting the right kind of register for a live range. Then we compare an enhanced Chaitin-style
Results 1 - 3 of 3