A cyclic scheduling problem with an undetermined number of parallel identical processors

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

A cyclic scheduling problem with an undetermined number of parallel identical processors

Abstract: Cyclic scheduling, Multi-processor scheduling, Digital signal processing applications,

Cited by 13 publications

References 19 publications

Design-Space Exploration with Multi-Objective Resource-Aware Modulo Scheduling

Design-Space Exploration with Multi-Objective Resource-Aware Modulo Scheduling

Efficient Operator Sharing Modulo Scheduling for Sum-Product Network Inference on FPGAs

The resource-constrained modulo scheduling problem: an experimental study

Contact Info

Product

Resources

About