On the Complexity of Spill Everywhere under SSA Form - ENS de Lyon - École normale supérieure de Lyon Access content directly
Journal Articles ACM SIGPLAN Notices Year : 2007

On the Complexity of Spill Everywhere under SSA Form


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.
Fichier principal
Vignette du fichier
lctes022-bouchez-RR-LIP.pdf (160.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ensl-00180322 , version 1 (18-10-2007)



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



Gmail Facebook Twitter LinkedIn More