The Meeting Graph : a New Framework for Loop Register Allocation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

The Meeting Graph : a New Framework for Loop Register Allocation

Christine Eisenbeis
  • Function : Author
  • PersonId : 833430
Sylvain Lelait
  • Function : Author
Bruno P Marmol

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.
Fichier principal
Vignette du fichier
RR-2758.pdf (326.24 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00073934 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073934 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More