Parallelization of sequential programs primarily focuses on loop structures since the array index variables in a loop usually exhibit data dependency among them. When the data dependency relation is constant in terms of distance, several compile time parallelization methods were introduced. On the other hand, when the data dependency relation varies in distance, the compile time extraction of parallelism is more complicated. We propose a generalized parallelism extraction scheme for nested loops. This method automatically converts a sequential loop into a nested parallel DOALL loop at compile time. Moreover, this algorithm can be applicable where the dependency relation is both constant and varying in distance. Our test results show the proposed scheme is superior to conventional methods when sufficiently large number of processors are provided.
['W.B. Song', 'Dong-Won Park', 'Byung‐Hee Kim', 'Y.H. Kong']
Extracting parallelism in nested loops