A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops

Sylvain Lelait 1 Guang R. Gao Christine Eisenbeis 1
1 A3 - Advanced analysis to code optimization
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : In this paper, we focus on the register allocation phase of software pipelinin- g. We are interested in optimal register allocation. This means that the number of registers used must be equal to the maximum number of simultaneously alive variables of the loop. Usually two different means are used to achieve this, namely register renaming or loop unrolling. As these methods have both drawbacks, we introduce here a solution which is a trade-off between inserting {\em move} operations and unrolling the loop. We present a new algorithmic framework of optimal register allocation for modulo scheduled loops. The proposed algorithm, called U&M, is simple and efficient. We have implemented it in MOST (Modulo Scheduling Toolset). An experimental study of our algorithm on more than 1000 loops has been performed and we report asummary of the main results. This new algorithm, that combines loop unrolling and register renaming, performs consistently better than several other existing methods.
Type de document :
Rapport
[Research Report] RR-3337, INRIA. 1998
Liste complète des métadonnées

https://hal.inria.fr/inria-00073352
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:36:11
Dernière modification le : jeudi 9 février 2017 - 15:55:59
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:51:48

Fichiers

Identifiants

  • HAL Id : inria-00073352, version 1

Collections

Citation

Sylvain Lelait, Guang R. Gao, Christine Eisenbeis. A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops. [Research Report] RR-3337, INRIA. 1998. <inria-00073352>

Partager

Métriques

Consultations de
la notice

142

Téléchargements du document

263