The Procedure Transformation using Data Dependency Elimination Methods


The KIPS Transactions:PartA, Vol. 9, No. 1, pp. 37-44, Mar. 2002
10.3745/KIPSTA.2002.9.1.37,   PDF Download:

Abstract

Most researches of transforming sequential programs into parallel programs have been based on the loop structure transformation method. However, most programs have implicit interprocedure parallelism. This paper suggests a way of extracting parallelism from the loops with procedure calls using the data dependency elimination method. Most parallelization of the loop with procedure calls have been conducted for extracting parallelism from the uniform code. In this paper, we propose interprocedural transformation, which can be apply to both uniform and nonuniform code. We show the examples of uniform, nonuniform, and complex code parallelization. We then evaluated the performance of the various transformation methods using the CRAY-T3E system. The comparison results show that the proposed algorithm out-performs other conventional methods.


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]
Y. S. Chang and D. S. Park, "The Procedure Transformation using Data Dependency Elimination Methods," The KIPS Transactions:PartA, vol. 9, no. 1, pp. 37-44, 2002. DOI: 10.3745/KIPSTA.2002.9.1.37.

[ACM Style]
Yu Sug Chang and Doo Soon Park. 2002. The Procedure Transformation using Data Dependency Elimination Methods. The KIPS Transactions:PartA, 9, 1, (2002), 37-44. DOI: 10.3745/KIPSTA.2002.9.1.37.