Register Allocation for Programs in SSA-Form
Compiler Construction(2007)
摘要
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its qual- ity and speed. We present a novel register allocation architecture for programs in SSA-form which simplifies register allocation significantly. We investigate certain properties of SSA-programs and their interfer- ence graphs, showing that they belong to the class of chordal graphs. This leads to a quadratic-time optimal coloring algorithm and allows for decoupling the tasks of coloring, spilling and coalescing completely. Af- ter presenting heuristic methods for spilling and coalescing, we compare our coalescing heuristic to an optimal method based on integer linear programming.
更多查看译文
关键词
register allocation,important phase,coalescing heuristic,quadratic-time optimal,integer linear programming,certain property,optimal method,heuristic method,chordal graph,novel register allocation architecture,optimizing compiler
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络