상세정보
학술대회
A Two-Phase Scheduling Algorithm for Efficient Collective Communications of MPICH-G2
- 저자
- 이정희, 한동수
- 발행일
- 200512
- 출처
- International Conference on Distributed Computing and Internet Technology (ICDCIT) 2005 (LNCS 3816), v.3816, pp.217-228
- 협약과제
- 05MW1100, 임베디드 S/W 표준 플랫폼 개발(산연공동으로 추진), 김흥남
- 초록
- In this paper, we propose a packet-level parallel data transfer and a Two-Phase Scheduling(TPS) algorithm for collective communication primitives in MPICH-G2. The algorithms are characterized by two unique features: 1) a concurrent data transfer of packets from a source node to multiple destination nodes and 2) a scheduling of enhancing the performance of collective communications by early identification of bottleneck incurring nodes. The proposed technique is implemented and the performance improvement is measured. According to the performance evaluation, the proposed method has achieved about 20% performance improvement against conventional block data transfer methods when a binomial tree is used for the communication in LAN. In TPS algorithm, the distribution of messages to bottleneck incurring nodes is delayed to minimize the affection of the node to the total performance. Using TPS algorithm on WAN, significant performance improvement has also been achieved for various data sizes and number of nodes. © Springer-Verlag Berlin Heidelberg 2005.
- KSP 제안 키워드
- Communication primitives, MPICH-G2, Parallel data transfer, Performance evaluation, Scheduling algorithm, Transfer method, Two-Phase Scheduling, binomial tree, collective communication, performance improvement