arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.3642cs.DScs.CC
收藏

论SSA形式下到处溢出的复杂性

On the Complexity of Spill Everywhere under SSA Form

Florent Bouchez, Alain Darte, Fabrice Rastello

摘要:

嵌入式处理器的编译可以是积极的(耗时的交叉编译),也可以是及时的(嵌入式的,通常是动态的)。在动态编译中使用的算法受到有限资源、时间和内存的高度限制。SSA的最新成果形成开放的有前途的方向,为嵌入式系统,特别是嵌入式编译的新的寄存器分配算法的设计。特别是,基于树扫描与两个独立的阶段-一个溢出,然后一个着色/合并-似乎是设计内存友好,快速,有竞争力的寄存器分配器的好候选人。尽管如此,也因为对功耗的副作用,最小化加载和存储开销(溢出问题)是一个重要的问题。本文提供了一个详尽的研究的复杂性的"溢出无处不在“的SSA形式的背景下的问题。不幸的是,与我们最初的希望相反,我们提出的许多问题导致了NP完全性结果。我们确定了一些多项式的情况下,但在JIT的上下文中是不切实际的。尽管如此,他们可以给提示,以简化公式的积极分配器的设计。

英文摘要:

Compilation for embedded processors can be either aggressive (time consuming cross-compilation) or just in time (embedded and usually dynamic). The heuristics used in dynamic compilation are highly constrained by limited resources, time and memory in particular. Recent results on the SSA form open promising directions for the design of new register allocation heuristics for embedded systems and especially for embedded compilation. In particular, heuristics based on tree scan with two separated phases -- one for spilling, then one for coloring/coalescing -- seem good candidates for designing memory-friendly, fast, and competitive register allocators. Still, also because of the side effect on power consumption, the minimization of loads and stores overhead (spilling problem) is an important issue. This paper provides an exhaustive study of the complexity of the ``spill everywhere'' problem in the context of the SSA form. Unfortunately, conversely to our initial hopes, many of the questions we raised lead to NP-completeness results. We identify some polynomial cases but that are impractical in JIT context. Nevertheless, they can give hints to simplify formulations for the design of aggressive allocators.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑