Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073933
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:07:06 PM
Last modification on : Wednesday, November 20, 2019 - 3:11:00 AM
Long-term archiving on: : Monday, April 5, 2010 - 12:01:58 AM

Identifiers

  • HAL Id : inria-00073933, version 1

Collections

Citation

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

Share

Metrics

Record views

262

Files downloads

250