Design and evaluation of an environment APE for automatic parallelization of programs
|
| Beijing, CHINA June 12-June 14 |
V. Chaudhary, Dept. of Electr. & Comput. Eng., Wayne State Univ., Detroit, MI, USA
Chengzhong Xu, Dept. of Electr. & Comput. Eng., Wayne State Univ., Detroit, MI, USA
S. Roy, Dept. of Electr. & Comput. Eng., Wayne State Univ., Detroit, MI, USA
Jialin Ju, Dept. of Electr. & Comput. Eng., Wayne State Univ., Detroit, MI, USA
V. Sinha, Dept. of Electr. & Comput. Eng., Wayne State Univ., Detroit, MI, USA
Laiwu Luo, Dept. of Electr. & Comput. Eng., Wayne State Univ., Detroit, MI, USA
In this paper, we present the design and evaluation of a compiler system, called APE, for automatic parallelization of scientific and engineering applications on distributed memory computers. APE is built on top of SUIF compiler. It extends SUIF with capabilities in parallelizing loops with non-uniform cross-iteration dependencies, and in handling loops that have indirect access patterns. We have evaluated the effectiveness of SUIF with several CFD test codes, and found that SUIF handles uniform loops over dense and regular data structures very well. For non-uniform loops, an innovative and efficient parallelization approach based on convex theory have been proposed and is being implemented. We have also presented a class of scalable algorithms for parallel distribution and redistribution of unstructured data structures during parallelizing irregular loops.
Index Terms:
parallelising compilers; programming environments; parallel programming; APE; automatic parallelization; compiler system; SUIF compiler; parallelizing loops; parallel distribution; unstructured data structures; data structures
Citation:
V. Chaudhary, Chengzhong Xu, S. Roy, Jialin Ju, V. Sinha, Laiwu Luo, "Design and evaluation of an environment APE for automatic parallelization of programs," ispan, pp.77, 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), 1996
Usage of this product signifies your acceptance of the
Terms of Use.
|
|
|
|
|
|
|
|