데이터 병렬 프로그램에서 배리어 대기시간의 분석

• 영문명: Analysis of Barrier Waiting Times in Data Parallel Programs
• 발행기관: 강원대학교 산업기술연구소
• 저자명: 정인범(Jung In Bum)
• 간행물 정보: 『산업기술연구』vol.21, 73~80쪽, 전체 8쪽
• 주제분류: 공학 > 공학일반
• 파일형태: PDF
• 발행일자: 2001.09.30

영문 초록

Barrier is widely used for synchronization in parallel programs. Since the process arrived earlier than others should wait at the barrier, the total processor utilization decreases. In this paper, to find the sources of the barrier waiting time, parallel programs alee executed on the various grain sizes through execution-driven simulations. In simulation studies, we found that even if approximately equal amounts of work are distributed to each processor, all processes may not arrive at a barrier at the same time. The reasons are that the different numbers of cache misses and instructions within partitioned grains result in the difference in arrival time of processors at the barrier.

목차

Abstract

1. Introduction

2. Related Works

3. Data parallel Programs

4. Simulation Environment

5. Performance Evaluation

6. Conclusion

References

키워드

동기화 병렬 프로그램 캐쉬 메모리 synchronization parallel program cache miss