Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors

Benabid, Abir; Hanen, Claire

doi:10.1016/j.endm.2010.05.100

Cited by 1 publication

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mean idea is to compute the priority of each operation using the schedule, that meets the precedence and resource constraints, of its successors. This algorithm was initially introduced for parallel processors systems and extended to pipelined processors in [BH10].…”

Section: Loop Compactionmentioning

confidence: 99%

The resource-constrained modulo scheduling problem: an experimental study

et al. 2012

Self Cite

View full text Add to dashboard Cite

In this paper, we focus on the resource-constrained modulo scheduling problem, a general periodic scheduling problem, abstracted from the problem solved by compilers when optimizing inner loops at instruction level for VLIW parallel processors. Heuristic solving scheme have been proposed since many years to solve this problem, among which the decomposed software pipeling method. In this method, a cyclic scheduling problem ignoring resource constraints is first considered and a so-called legal retiming of the operations is issued. Second, a standard acyclic problem, taking this retiming as input, is solved through list scheduling techniques. In this paper, we propose an hybrid approach, which uses the decomposed software pipeling method to obtain a good retiming. Then the obtained retiming is used to build an Integer Linear Programming formulation of reduced size, which allows to solve it exactly. Experimental results show that a lot more problems are solved with this new approach. The gap to the optimal solution is really small (0 or 1%) on all the tested problem instances.

show abstract

Section: Loop Compactionmentioning

confidence: 99%