Skip to Main content Skip to Navigation
New interface
Conference papers

A Polynomial Spilling Heuristic: Layered Allocation

Boubacar Diouf 1 Albert Cohen 1 Fabrice Rastello 2 
1 Parkas - Parallélisme de Kahn Synchrone
DI-ENS - Département d'informatique - ENS Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
2 COMPSYS - Compilation and embedded computing systems
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Register allocation is one of the most important, and one of the oldest compiler optimizations. It aims to map temporary variables to machine registers, and defaults to explicit load/store from memory when necessary. The latter option is referred to as spilling. This paper addresses the minimization of the spill code overhead, one of the difficult problems in register allocation. We devised a heuristic, polynomial approach called "layered". It is rooted in the recent advances in decoupled register allocation. As opposed to conventional incremental spilling, our method incrementally allocates clusters of variables. We demonstrate its quasi-optimiality on standard benchmarks and on two architectures.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Albert Cohen Connect in order to contact the contributor
Submitted on : Sunday, December 1, 2013 - 1:09:55 AM
Last modification on : Tuesday, October 25, 2022 - 4:22:19 PM
Long-term archiving on: : Monday, March 3, 2014 - 8:45:48 PM


Files produced by the author(s)



Boubacar Diouf, Albert Cohen, Fabrice Rastello. A Polynomial Spilling Heuristic: Layered Allocation. CGO 2013 - International Symposium on Code Generation and Optimization, Feb 2013, Shenzhen, China. ⟨10.1109/CGO.2013.6495005⟩. ⟨hal-00911887⟩



Record views


Files downloads