HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

The Meeting Graph : a New Framework for Loop Register Allocation

Abstract : Register allocation is a compiler phase where the gains can be essential in achieving performance on new architectures exploiting instruction level parallelism. We focus our attention on loops and improve the existing methods by introducing a new kind of graph. We model loop unrolling and register allocation together in a common framework, called the {\em meeting graph}. We expect that our results improve significantly loop register allocation while keeping the amount of code replication low. As a byproduct, we present an optimal algorithm for allocating loop variables to a rotating register file, as well as a new heuristic for loop variables spilling.
Document type :
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:07:13 PM
Last modification on : Thursday, February 3, 2022 - 11:16:03 AM
Long-term archiving on: : Thursday, March 24, 2011 - 1:25:47 PM


  • HAL Id : inria-00073934, version 1



Christine Eisenbeis, Sylvain Lelait, Bruno Marmol. The Meeting Graph : a New Framework for Loop Register Allocation. [Research Report] RR-2758, INRIA. 1995. ⟨inria-00073934⟩



Record views


Files downloads