Theory of linear and integer programming
Theory of linear and integer programming
Optimal scheduling and allocation of embedded VLSI chips
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Computer organization & design: the hardware/software interface
Computer organization & design: the hardware/software interface
Allocating registers in multiple instruction-issuing processors
PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
Minimizing register requirements of a modulo schedule via optimum stage scheduling
International Journal of Parallel Programming
Optimal software pipelining with function unit and register constraints
Optimal software pipelining with function unit and register constraints
Processor Architecture: From Dataflow to Superscalar and Beyond
Processor Architecture: From Dataflow to Superscalar and Beyond
Scheduling and Automatic Parallelization
Scheduling and Automatic Parallelization
Code Optimization by Integer Linear Programming
CC '99 Proceedings of the 8th International Conference on Compiler Construction, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Early control of register pressure for software pipelined loops
CC'03 Proceedings of the 12th international conference on Compiler construction
| Hi-index | 0.00 |
To sustain the increases in processor performance, embedded and real-time systems need to find the best total schedule time when compiling their application. The optimal acyclic scheduling problem is a classical challenge which has been formulated using integer programming in lot of works. In this paper, we give a new formulation of acyclic instruction scheduling problem under registers and resources constraints in multiple instructions issuing processors with cache effects. Given a direct acyclic graph G = (V, E), the complexity of our integer linear programming model is bounded by &Ogr;(¦V¦2) variables and &Ogr;(¦E¦+¦V¦2) constraints. This complexity is better than the complexity of the existing techniques which includes a worst total schedule time factor.