A Loop Transformation for Maximizing Parallelism from Single Loops with Nonuniform Dependencies

Authors:
Chul-Kwon Cho;Jae-Chan Shim;Mann-Ho Lee
Affiliations:
-;-;-
Venue:
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Year:
1997

Citing 6
Cited 0

Automatic translation of FORTRAN programs to vector form

ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiler Optimizations for Enhancing Parallelism and Their Impact on Architecture Design

IEEE Transactions on Computers - Special issue on architectural support for programming languages and operating systems
Supercompilers for parallel and vector computers

Supercompilers for parallel and vector computers
Exploiting the parallelism available in loops

Computer
Optimizing Supercompilers for Supercomputers

Optimizing Supercompilers for Supercomputers
A Loop Transformation Theory and an Algorithm to Maximize Parallelism

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes several loop splitting methods for exploiting parallelism from single loops, and also proposes a generalized and optimal loop transformation technique for exploiting parallelism from single loops with nonuniform dependencies. The proposed algorithm is based on partitioning a serial loop by using the size of dependence distance such that it varies between different instances of the dependence. It outperforms the two methods proposed in Polychronopoulos.