ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 A Novel Sequential Tree Algorithm Based on Scoreboard for MPI Broadcast Communication
Cited 1 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
정원영, 박재원, 이승우, 노원우, 이용석
발행일
201112
출처
IEICE Transactions on Information and Systems, v.E94.D no.12, pp.2523-2527
ISSN
0916-8532
출판사
일본, 전자정보통신학회 (IEICE)
DOI
https://dx.doi.org/10.1587/transinf.E94.D.2523
협약과제
11MI1600, Scalable 마이크로 플로우 처리기술개발, 이범철
초록
The message passing interface (MPI) broadcast communication commonly causes a severe performance bottleneck in multicore system that uses distributed memory. Thus, in this paper, we propose a novel algorithm and hardware structure for the MPI broadcast communication to reduce the bottleneck situation. The transmission order is set based on the state of each processing node that comprises the multicore system, so the novel algorithm minimizes the performance degradation caused by conflict. The proposed scoreboard MPI unit is evaluated by modeling it with SystemC and implemented using VerilogHDL. The size of the proposed scoreboard MPI unit occupies less than 1.03% of the whole chip, and it yields a highly improved performance up to 75.48% as its maximum with 16 processing nodes. Hence, with respect to low-cost design and scalability, this scoreboard MPI unit is particularly useful towards increasing overall performance of the embedded MPSoC. Copyright © 2011 The Institute of Electronics, Information and Communication Engineers.
키워드
Broadcast communication, Distributed memory, MPI, MPSoC, Multicore
KSP 제안 키워드
Broadcast communication, Information and communication, Low-cost, Multi-core system, Novel algorithm, Overall performance, Processing Node, Tree algorithm, distributed memory, hardware structure, improved performance