Non-uniform에서 종속성 제거 방법을 이용한 프로시저 변환 알고리즘 = The Procedure Transformation Algorithm Using Dependency Elimination in Non-uniform

다국어 초록 (Multilingual Abstract)

Generally, In a application program the core part for parallel processing is a loop. Because the loop exists data dependencies between the array index variable of a loop. Specially, the data dependence relations between statements which of variable or constant dependence distance are very complex. In this paper propose procedure transformation Algorithm which can be apply to non-uniform code. A performance test results show the proposal scheme is superior to conventional method.

참고문헌 (Reference)

1 장유숙, "자료 종속성 제거 방법을 이용한 프로시저 변환" 한국정보처리학회 9 (9): 37-44, 2002

2 Hollander, E. H., "Partitioning and labeling of loops by unimodular transformations" 3 (3): 465-476, 1992

3 Shang, W., "On loop transformations for generalized cycle shrinking" 132-141, 1991

4 Agustin Fernandez, "Loop Tronsformation Using Non-unimodular Matrices" 1995

5 Keith D. Cooper, "In-terprocedural constant propagation" Department of Computer Science, Rice University 1985

6 M. J. Wolfe, "High Performance Compilers for Parallel Computing" Addison-Wesley Publishing Company 1995

7 박두순, "Extracting Parallelism in Nested Loops" IEEE 41-47, 1996

8 Z. Li, "Efficient interprocedural analysis for program restructuring for parallel programs" 1998

9 K.D cooper, "An experiment with inline substitution" Dept. of computer Science, Rice University 1990

10 R. W. Scheifler, "An analysis of inline substitution for a structured programming language" 1995