ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Four-ary tree-based barrier synchronization for 2D meshes without nonmember involvement
Cited 13 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
모상만, Chansu Yu, Ben Lee, Hee Yong Youn, Dongsoo Han, Dongman Lee
발행일
200108
출처
IEEE Transactions on Computers, v.50 no.8, pp.811-823
ISSN
0018-9340
출판사
IEEE
DOI
https://dx.doi.org/10.1109/12.947001
협약과제
01MC2600, 인터넷 서버용 차세대 클러스터 연결망 기술개발, 김용연
초록
This paper proposes a Barrier Tree for Meshes (BTM) to minimize the barrier synchronization latency for two-dimensional (2D) meshes. The proposed BTM scheme has two distinguishing features. First, the synchronization tree is 4-ary. The synchronization latency of the BTM scheme is asymptotically ??(log4n), while that of the fastest scheme reported in the literature is bounded between 廓(log3n) and O(n1/2), where n is the number of member nodes. Second, nonmember nodes are neither involved in the construction of a BTM nor actively participate in the synchronization operations, which avoids interference among different process groups during synchronization. This not only results in low setup overhead, but also reduces the synchronization latency. The low setup overhead is particularly effective for the dynamic process model provided in MPI-2. Extensive simulation study shows that, for up to 64 × 64 meshes, the BTM scheme results in about 40 ~ 70 percent shorter synchronization latency and is more scalable than conventional schemes.
KSP 제안 키워드
Barrier synchronization, Barrier tree, Dynamic process model, Simulation study, Tree-based, distinguishing features, two-dimensional(2D)