Distributed Prodessing and Data Dependency Elimination for Parallelism in Nested Loops


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 6, pp. 1494-1506, Jun. 1998
10.3745/KIPSTE.1998.5.6.1494,   PDF Download:

Abstract

In this paper, a general method the extracting parallelism in nested loops is presented. This is a procedure for the automatic conversion of a sequential loop into a nested parallel DOALL loops at compile time. Moreover, this algorithm can be applicable where the dependency relation is both uniform and non-uniform in distance. Our test results show the proposed scheme is superior to conventional methods. The algorithm which effectively removes these kind of data dependencies is developed in order to present the total parallelization of nested loops.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. W. Bong and P. D. Soon, "Distributed Prodessing and Data Dependency Elimination for Parallelism in Nested Loops," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 6, pp. 1494-1506, 1998. DOI: 10.3745/KIPSTE.1998.5.6.1494.

[ACM Style]
Song Weol Bong and Park Doo Soon. 1998. Distributed Prodessing and Data Dependency Elimination for Parallelism in Nested Loops. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 6, (1998), 1494-1506. DOI: 10.3745/KIPSTE.1998.5.6.1494.