Theory of linear and integer programming
Theory of linear and integer programming
A study of the cyclic scheduling problem on parallel processors
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Minimizing register requirements of a modulo schedule via optimum stage scheduling
International Journal of Parallel Programming
Schedule-independent storage mapping for loops
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
A unified framework for schedule and storage optimization
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Parametric Computation of Margins and of Minimum Cumulative Register Lifetime Dates
LCPC '96 Proceedings of the 9th International Workshop on Languages and Compilers for Parallel Computing
ACM Transactions on Embedded Computing Systems (TECS)
SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
In this paper, we study the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We have already presented in [9] a theoretical framework that allows an optimal optimization of periodic storage requirement in a periodic schedule. This problem is used to optimize processor register usage in embedded systems. Our storage optimization problem being NP-complete [8], solving an exact integer linear programming formulation is too expensive in practice. In this article, we propose an efficient two-steps heuristic using model's properties that allows fast resolution times while providing nearly optimal results. This method includes the resolution of a integer linear program with a totally unimodular constraints matrix in first step, then the resolution of a linear assignment problem. Our solution has been implemented and included inside a compiler for embedded processors.