Section: New Results

Incremental Spilling

Participants : Albert Cohen [Inria, Parkas] , Boubacar Diouf [Université Paris Sud, Parkas] , Fabrice Rastello.

This work addresses the minimization of the spill code overhead in the contexts of both coupled and decoupled register allocation. We devised a heuristic approach called stacking; it incrementally allocates clusters of variables, as opposed to the conventional incremental spilling approach. We describe two polynomial methods, a stacking-optimal allocator and a greedy stacking-independent-set allocator. The first method is very close to the optimal allocation; the second method outperforms state-of-the-art heuristics for just-in-time compilation.

This work has been submitted for publication.