Paper Info
Title
A new guaranteed heuristic for the software pipelining problem
Abstract
lVe present yet another heuristic for the software pipelining problem. This heuristic 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 [6]. Finally, we point out that, in its simplest form, our algorithm has a lower complexity.
Year
DOI
Venue
1996
10.1145/237578.237613
ICS '96 Proceedings of the 10th international conference on Supercomputing
Keywords
Field
DocType
list scheduling,cyclic scheduling,circuit retiming,guaranteed heuristic,software pipelining,new guaranteed heuristic
Retiming,Heuristic,Yet another,List scheduling,Software pipelining,Computer science,Parallel computing,Cyclic scheduling,Real-time computing
Conference
ISBN
Citations 
PageRank 
0-89791-803-7
5
0.70
References 
Authors
6
3
Name
Order
Citations
PageRank
pierreyves calland1846.16
Alain Darte288856.40
Yves Robert385068.62