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.
Type de document :
[Research Report] RR-2758, INRIA. 1995
Liste complète des métadonnées

Littérature citée [2 références]  Voir  Masquer  Télécharger
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:07:13
Dernière modification le : mercredi 5 septembre 2018 - 15:14:22
Document(s) archivé(s) le : jeudi 24 mars 2011 - 13:25:47



  • 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〉



Consultations de la notice


Téléchargements de fichiers