19 search results - page 1 / 4 » A New Fast Algorithm for Optimal Register Allocation in Modu... |
CC
1998
Springer
13 years 9 months ago
1998
Springer
PLDI
2005
ACM
13 years 10 months ago
2005
ACM
Modulo scheduling is an effective code generation technique that exploits the parallelism in program loops by overlapping iterations. One drawback of this optimization is that reg...
CC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The register allocation in loops is generally performed after or during the software pipelining process. This is because doing a conventional register allocation at firs...
MICRO
2005
IEEE
13 years 10 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
LCPC
2009
Springer
13 years 9 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...