원문정보
A study on the effective synchronization optimization methods in parallel processing system
초록
영어
This paper discusses an effective synchronization algorithm. It is different from the existing synchronization methods by inserting appropriate synchronization instructions between statements according to different kinds of data dependences. The overhead caused by too many synchronization instructions in a loop can be a critical problem. Synchronization optimization is a method which discriminates and eliminates the redundant synchronization instructions in a loop. In this paper, a new synchronization optimization algorithm - ICPG (Improved Controlled Path Graph) - is developed, and the algorithm is extended to the case of nested loops. In case of nested loops, the existing methods were not safe because of the incomplete management in hyper-rectangle areas, etc. But, the errorneous methods are completely corrected in this paper. Finally, performance analysis using simulation on the UNIX operating system is carried out. It is shown that the ICPG algorithm is much more effective than the existing methods.
목차
II. 단일 루프내의 동기화 기법
1. 제안된 동기화 명령어 쌍 (tuple)
2. 흐름 종속 동기화
3. 반종속 동기화
4. 가변 종속 동기화
III. 단일 루프내의 동기최적화
1. 기존의 방법
2. 제안된 기법
IV. 중첩 루프로의 동기화 확장
1. ICPG의 확장
2. 중첩 루프에서의 중복 동기화명령어 제거 기법
V. 성능평가
VI. 결론
參考文獻
Abstract