Loop distribution with arbitrary control flow

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 ow, previous methods for loop distribution have signi cant drawbacks. We present a new algorithm for loop distribution in the presence of control ow 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 algorithmsare being developed for use in an interactive parallel programming environment for Fortran, they are very general and can be used in automatic parallelization and vectorization systems.

• Type: Conference
• Year: 1990
• Where: SC
• Authors: Ken Kennedy, Kathryn S. McKinley
• Keywords: Applied Computing, Control Dependence Graph, Control Ow, Loop Distribution, SC 1990