EquiMax. A New Formulation of Acyclic Scheduling Problem for ILP Processors

Sid Touati 1
1 A3 - Advanced analysis to code optimization
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : In this paper, we give a new formulation of acyclic scheduling problem under registers and resources constraints in multiple instructions issuing processors (VLIW and superscalar). Given a direct acyclic data dependence graph G = (V; E), the complexity of our integer linear programming model is bounded ) variables and O(jEj + jV j ) constraints according to a target architecture description. This complexity is better than the complexity of the existing techniques which includes a worst total schedule time factor.
Type de document :
Chapitre d'ouvrage
Gyungho and Pen-Chung Yew. Interaction between Compilers and Computer Architecture, Kluwer Academic Publishers, 2001, 0-7923-7370-7
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00646739
Contributeur : Sid Touati <>
Soumis le : vendredi 23 décembre 2011 - 13:58:17
Dernière modification le : mercredi 29 novembre 2017 - 15:11:23
Document(s) archivé(s) le : vendredi 11 mai 2012 - 15:55:37

Fichier

dag_plne.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00646739, version 1

Collections

Citation

Sid Touati. EquiMax. A New Formulation of Acyclic Scheduling Problem for ILP Processors. Gyungho and Pen-Chung Yew. Interaction between Compilers and Computer Architecture, Kluwer Academic Publishers, 2001, 0-7923-7370-7. 〈hal-00646739〉

Partager

Métriques

Consultations de la notice

190

Téléchargements de fichiers

93