TY - JOUR
T1 - A Simulation Study of Scalable Broadcast in High-Performance Regular Networks
AU - al-Dubai, A. Y.
AU - Ould-Khaoua, M.
AU - Obaidat, M. S.
PY - 2004/5
Y1 - 2004/5
N2 - Broadcast is an important communication operation required by many real-world applications encountered in parallel, cluster, and grid computing environments. Broadcasting on regular networks has been widely investigated in the past. However, most of the existing algorithms handle broadcast in a sequential manner and do not scale well; as a consequence, many applications cannot be efficiently supported using existing algorithms. In an effort to avoid this limitation, this article presents a new broadcast algorithm based on coded path routing. In addition to its simplicity, the proposed algorithm has shown to be capable of performing the broadcast operation in a fixed number of message-passing steps, irrespective of the network size. An extensive simulation study has been conducted to evaluate the performance of the proposed algorithm under different traffic working conditions. The analysis reveals that the new algorithm exhibits superior performance characteristics over those of the well-known recursive-doubling and extended-dominating node algorithms.
AB - Broadcast is an important communication operation required by many real-world applications encountered in parallel, cluster, and grid computing environments. Broadcasting on regular networks has been widely investigated in the past. However, most of the existing algorithms handle broadcast in a sequential manner and do not scale well; as a consequence, many applications cannot be efficiently supported using existing algorithms. In an effort to avoid this limitation, this article presents a new broadcast algorithm based on coded path routing. In addition to its simplicity, the proposed algorithm has shown to be capable of performing the broadcast operation in a fixed number of message-passing steps, irrespective of the network size. An extensive simulation study has been conducted to evaluate the performance of the proposed algorithm under different traffic working conditions. The analysis reveals that the new algorithm exhibits superior performance characteristics over those of the well-known recursive-doubling and extended-dominating node algorithms.
KW - Collective communication
KW - grid and cluster computing
KW - multicast latency
KW - performance analysis
KW - regular networks
KW - simulation
UR - http://www.scopus.com/inward/record.url?scp=3342962614&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=3342962614&partnerID=8YFLogxK
U2 - 10.1177/0037549704044325
DO - 10.1177/0037549704044325
M3 - Article
AN - SCOPUS:3342962614
SN - 0037-5497
VL - 80
SP - 207
EP - 220
JO - Simulation
JF - Simulation
IS - 4-5
ER -