A new guaranteed heuristic for the software pipelining problem.

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 Gasperoni and Schwiegelshohn's heuristic. Finally, we point out that, in its simplest form, our algorithm has a lower complexity.
Document type :
Reports
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102096
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:14:08 AM
Last modification on : Friday, April 19, 2019 - 1:38:16 AM

File

RR1995-42.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102096, version 1

Collections

Citation

Pierre-Yves Calland, Alain Darte, Yves Robert. A new guaranteed heuristic for the software pipelining problem.. [Research Report] LIP RR-1995-42, Laboratoire de l'informatique du parallélisme. 1995, 2+24p. ⟨hal-02102096⟩

Share

Metrics

Record views

22

Files downloads

39