Computer Science – Data Structures and Algorithms
Scientific paper
2007-10-19
ACM SIGPLAN Notices Issue 7, Volume 42 (2007) 103 - 112
Computer Science
Data Structures and Algorithms
10 pages
Scientific paper
10.1145/1254766.1254782
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.
Bouchez Florent
Darte Alain
Rastello Fabrice
No associations
LandOfFree
On the Complexity of Spill Everywhere under SSA Form does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Complexity of Spill Everywhere under SSA Form, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Spill Everywhere under SSA Form will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-708400