7 search results - page 1 / 2 » Partitioning Loops with Variable Dependence Distances |
ICPP
2000
IEEE
13 years 9 months ago
2000
IEEE
A new technique to parallelize loops with variable distance vectors is presented. The method extends previous methods in two ways. First, the present method makes it possible for ...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
CC
2003
Springer
13 years 9 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...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of in...
CC
2008
Springer
13 years 6 months ago
2008
Springer
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...