Maximizing for Reducing the Register Need in Acyclic Schedules

Sid Touati 1
1 A3 - Advanced analysis to code optimization
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : In this article, we give our heuristics to carry out the register allocation before acyclic code scheduling with the respect of the critical path. We proceed by "maximizing" the register need instead of minimizing it [15]. Intuitively, maximizing the register need implies a minimization of the false dependencies introduced by the register reuse. If the maximal register requirement exceeds the number of available register R, we add fictitious arcs in the DAG to prohibit any schedule from needing more than R registers.
Type de document :
Communication dans un congrès
5th International Workshop on Software and Compilers for Embedded Systems, SCOPES '2001, Mar 2001, St Goar, Germany. 2001
Liste complète des métadonnées

https://hal.inria.fr/hal-00646770
Contributeur : Sid Touati <>
Soumis le : mercredi 30 novembre 2011 - 17:05:50
Dernière modification le : jeudi 9 février 2017 - 15:53:44
Document(s) archivé(s) le : jeudi 1 mars 2012 - 02:32:32

Fichier

Maximizing_for_Reducing-2.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00646770, version 1

Collections

Citation

Sid Touati. Maximizing for Reducing the Register Need in Acyclic Schedules. 5th International Workshop on Software and Compilers for Embedded Systems, SCOPES '2001, Mar 2001, St Goar, Germany. 2001. 〈hal-00646770〉

Partager

Métriques

Consultations de la notice

209

Téléchargements de fichiers

45