A Framework for Resource-Constrained Rate-Optimal Software Pipelining
IEEE Transactions on Parallel and Distributed Systems
A parametric critical path problem and an application for cyclic scheduling
Discrete Applied Mathematics
On a graph-theoretical model for cyclic register allocation
Discrete Applied Mathematics
Scheduling of Iterative Algorithms on FPGA with Pipelined Arithmetic Unit
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling
Computers and Industrial Engineering
Note: A note on periodic schedules for linear precedence constraints
Discrete Applied Mathematics
Steady state analysis of timed event graphs with time window constraints
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider in this paper a set of generic tasks constrained by a set of uniform precedence constraints corresponding to a natural generalization of the basic cyclic scheduling problem. The two parameters of any uniform constraint (namely the value and the height) between two tasks may be negative, which allows one to tackle a larger class of practical applications.We firstly study the structure and the existence of a periodic schedule. A necessary and sufficient condition for the existence of a schedule is then deduced. As there are no resource constraints, tasks following the earliest schedule have minimum average cycle times. The permanent state of the earliest schedule is characterized and we point out that the minimum average cycle times of tasks are equal for the earliest schedule and an optimal periodic schedule. An algorithm to check the existence of a schedule and to compute these minimum average cycle times using linear programming is lastly presented.