Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization, vectorization, and memory management. For loops with control flow, previous methods for loop distribution have significant drawbacks. We present a new algorithm for loop distribution in the presence of control flow modeled by a control dependence graph. This algorithm is shown optimal in that it generates the minimum number of new arrays and tests possible. We also present a code generation algorithm that produces code for the resulting program without replicating statements or conditions. Although these algorithms are being developed for use in an interactive parallel programming environment for Fortran...
In general, any nested loop can be parallelized as long as all dependence constraints among iteratio...
A new technique to parallelize loops with variable distance vectors is presented. The method extends...
(eng) In this paper, we survey loop parallelization algorithms, analyzing the dependence representat...
This work leverages an original dependency analysis to parallelize loops regardless of their form i...
Data parallel programming languages, such as HPF, are the easiest way to program Distributed Memory ...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
In this paper we present an intermediate program representation, called the program dependence graph...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
Modern computers will increasingly rely on parallelism to achieve high computation rates. Techniques...
AbstractA lot of work has been done in parallelizing nested loops with uniform dependences, from dep...
Special issue on "Optimizing Compilers for Parallel Languages"International audienceWe explore the l...
In order to reduce remote memory accesses on CC-NUMA multiprocessors, we present an interprocedural ...
The paper extends the framework of linear loop transformations adding a new nonlinear step at the tr...
Loops are the main source of parallelism in scientific programs. Hence, several techniques were dev...
In general, any nested loop can be parallelized as long as all dependence constraints among iteratio...
A new technique to parallelize loops with variable distance vectors is presented. The method extends...
(eng) In this paper, we survey loop parallelization algorithms, analyzing the dependence representat...
This work leverages an original dependency analysis to parallelize loops regardless of their form i...
Data parallel programming languages, such as HPF, are the easiest way to program Distributed Memory ...
In this paper, we survey loop parallelization algorithms, analyzing the dependence representations t...
In this paper we present an intermediate program representation, called the program dependence graph...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops becau...
Modern computers will increasingly rely on parallelism to achieve high computation rates. Techniques...
AbstractA lot of work has been done in parallelizing nested loops with uniform dependences, from dep...
Special issue on "Optimizing Compilers for Parallel Languages"International audienceWe explore the l...
In order to reduce remote memory accesses on CC-NUMA multiprocessors, we present an interprocedural ...
The paper extends the framework of linear loop transformations adding a new nonlinear step at the tr...
Loops are the main source of parallelism in scientific programs. Hence, several techniques were dev...
In general, any nested loop can be parallelized as long as all dependence constraints among iteratio...
A new technique to parallelize loops with variable distance vectors is presented. The method extends...
(eng) In this paper, we survey loop parallelization algorithms, analyzing the dependence representat...