DocumentCode
3146618
Title
A novel sequential tree algorithm based on the status of the processing nodes to reduce congestion
Author
Ki-woong Eom ; Won-young Chung ; Yong-surk Lee
Author_Institution
Sch. of EE Eng., Yonsei Univ., Seoul, South Korea
fYear
2011
fDate
17-18 Nov. 2011
Firstpage
211
Lastpage
214
Abstract
In recent years, consumers´ demand for high-performance IT equipment has grown rapidly. Thus, the Multiple-Processor System on a Chip (MPSoC) and the distributed memory system are widely researched for improvement in the performance of the embedded system. The Message Passing Interface (MPI) specification is the software platform for using the distributed memory system on MPSoC. In addition, MPI_Bcast function is one of the most frequently used functions. Thus, we proposed a novel MPI broadcasting algorithm and hardware architecture for performance improvement. Since the proposed algorithm checks the status of processing nodes and reschedules the order of transmission, processing time can be reduced. In simulation, the proposed algorithm reduced the processing time a maximum of 286605ns (general sequential tree algorithm: 2851160ns, proposed sequential algorithm: 2294355ns) and improved the performance up to 71.3% with an 8-processing-node system.
Keywords
distributed memory systems; embedded systems; message passing; system-on-chip; 8-processing-node system; MPI broadcasting algorithm; MPI_Bcast function; MPSoC; distributed memory system; embedded system; hardware architecture; high-performance IT equipment; message passing interface; multiple-processor system on a chip; sequential tree algorithm; software platform; time 2294355 ns; time 2851160 ns; time 286605 ns; MPI; MPSoC; broadcast communication; distributed memory; multicore;
fLanguage
English
Publisher
ieee
Conference_Titel
SoC Design Conference (ISOCC), 2011 International
Conference_Location
Jeju
Print_ISBN
978-1-4577-0709-4
Electronic_ISBN
978-1-4577-0710-0
Type
conf
DOI
10.1109/ISOCC.2011.6138747
Filename
6138747
Link To Document