The complexity of register allocation
The complexity of register allocation
复制标题
寄存器分配的复杂性
DOI:
10.1016/j.dam.2013.03.015
复制
发表时间:
2014
期刊:
影响因子:
--
通讯作者:
Philipp Krause
中科院分区:
文献类型:
--
作者:
Philipp Krause
In compilers, register allocation is one of the most important stages with respect to optimization for typical goals, such as code size, code speed, or energy efficiency. Graph theoretically, optimal register allocation is the problem of finding a maximum weight r-colorable induced subgraph in the conflict graph of a given program. The parameter r is the number of registers. Large classes of programs are structured, ie their control-flow graphs have bounded tree-width (Thorup (1998)[17], Gustedt et al.(2002)[8] and Burgstaller et al.(2004)[3]). The decision problem of deciding if a conflict graph of a structured program is r-colorable is known to be fixed-parameter tractable (Bodlaender et al.(1998)[1]). Optimal register allocation for structured programs is known to be in XP (Krause (2013)[13]). We complement these results by showing that optimal register allocation parametrized by r is W [SAT]-hard. This even holds for programs using only if/else and while as control structures; these programs form are subclass of the structured programs.
登录
查看更多内容
DOI:
--
发表时间:
1998
期刊:
ACM-SIAM Symposium on Discrete Algorithms
影响因子:
--
作者:
H. Bodlaender;J. Gustedt;J. A. Telle
通讯作者:
J. A. Telle
DOI:
10.1137/0601025
发表时间:
1980-06
期刊:
SIAM J. Algebraic Discret. Methods
影响因子:
--
作者:
M. Garey;David S. Johnson;G. Miller;C. Papadimitriou
通讯作者:
M. Garey;David S. Johnson;G. Miller;C. Papadimitriou
DOI:
--
发表时间:
2004
期刊:
International Conference on Reliable Software Technologies
影响因子:
--
作者:
Bernd Burgstaller;Johann Blieberger;Bernhard Scholz
通讯作者:
Bernhard Scholz
DOI:
--
发表时间:
1985
期刊:
Australian Computer Journal
影响因子:
--
作者:
C. L. Hamblin
通讯作者:
C. L. Hamblin
DOI:
--
发表时间:
1967
期刊:
影响因子:
--
作者:
R. Halin
通讯作者:
R. Halin