Skip to Main content Skip to Navigation
Journal articles

On the Complexity of Spill Everywhere under SSA Form

Abstract : 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.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Florent Bouchez Connect in order to contact the contributor
Submitted on : Thursday, October 18, 2007 - 4:52:19 PM
Last modification on : Saturday, September 11, 2021 - 3:17:39 AM
Long-term archiving on: : Sunday, April 11, 2010 - 11:15:34 PM


Files produced by the author(s)




Florent Bouchez, Alain Darte, Fabrice Rastello. On the Complexity of Spill Everywhere under SSA Form. ACM SIGPLAN Notices, Association for Computing Machinery (ACM), 2007, Volume 42 (Issue 7), pp.103 - 112. ⟨10.1145/1254766.1254782⟩. ⟨ensl-00180322⟩



Record views


Files downloads