A New Guaranteed Heuristic for the Software Pipelining Problem

Pierre-Yves Calland 1 Alain Darte 1 Yves Robert 1
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We present yet another heuristic for the software pipelining problem. We believe this heuristic to be of interest because it brings a new insight to the software pipelining problem by establishing its deep link with the circuit retiming problem. Also, in the single resource class case, our new heuristic is guaranteed, with a better bound than that of~\cite{GasperoniSc94}. Finally, we point out that, in its simplest form, our algorithm has a lower complexity.
Type de document :
[Research Report] RR-2759, INRIA. 1995
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:07:06
Dernière modification le : vendredi 20 avril 2018 - 15:44:24
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:01:58



  • HAL Id : inria-00073933, version 1


Pierre-Yves Calland, Alain Darte, Yves Robert. A New Guaranteed Heuristic for the Software Pipelining Problem. [Research Report] RR-2759, INRIA. 1995. 〈inria-00073933〉



Consultations de la notice


Téléchargements de fichiers