Theory of linear and integer programming
Theory of linear and integer programming
Introduction to algorithms
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Register allocation for software pipelined loops
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
A novel framework of register allocation for software pipelining
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Schedule-independent storage mapping for loops
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
On a graph-theoretical model for cyclic register allocation
Discrete Applied Mathematics
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
On Periodic Register Need in Software Pipelining
IEEE Transactions on Computers
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Periodic register saturation in innermost loops
Parallel Computing
The R Book
| 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 (Touati and Eisenbeis, Parallel Process. Lett. 14(2):287---313, 2004) a theoretical framework that allows an optimal optimisation of periodic storage requirement in a cyclic schedule. Since our optimisation problem is NP-hard (Touati, PhD thesis, 2002), 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 computation times while providing highly satisfactory results. This method includes the solution of an integer linear program with a totally unimodular constraints matrix in first step, then the solution of a linear assignment problem. Our heuristic is implemented for an industrial compiler for embedded VLIW processors.