Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

https://hal.inria.fr/inria-00073934
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:07:13 PM
Last modification on : Monday, January 18, 2021 - 12:12:02 PM
Long-term archiving on: : Thursday, March 24, 2011 - 1:25:47 PM

Identifiers

  • HAL Id : inria-00073934, version 1

Collections

Citation

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

Share

Metrics

Record views

523

Files downloads

532