TY - GEN
T1 - A scalable broadcast algorithm for multiport meshes with minimum communication steps
AU - Al-Dubai, Ahmed Yassin
AU - Ould-Khaoua, Mohamed
N1 - Publisher Copyright:
© 2002 IEEE.
PY - 2002
Y1 - 2002
N2 - Many broadcast algorithms have been proposed for the mesh over the past decade. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by these observations, this study proposes a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is that it handles broadcast operations with a fixed number of message passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in (Al-Dubai and Ould-Khaous, 2001). Results from extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.
AB - Many broadcast algorithms have been proposed for the mesh over the past decade. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by these observations, this study proposes a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is that it handles broadcast operations with a fixed number of message passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in (Al-Dubai and Ould-Khaous, 2001). Results from extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.
KW - Algorithm design and analysis
KW - Broadcasting
KW - Concurrent computing
KW - Delay
KW - Distributed computing
KW - Large-scale systems
KW - Partitioning algorithms
KW - Performance analysis
KW - Routing
KW - Scalability
UR - http://www.scopus.com/inward/record.url?scp=84948748059&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84948748059&partnerID=8YFLogxK
U2 - 10.1109/ICPADS.2002.1183400
DO - 10.1109/ICPADS.2002.1183400
M3 - Conference contribution
AN - SCOPUS:84948748059
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 203
EP - 208
BT - Proceedings - 9th International Conference on Parallel and Distributed Systems, ICPADS 2002
PB - IEEE Computer Society
T2 - 9th International Conference on Parallel and Distributed Systems, ICPADS 2002
Y2 - 17 December 2002 through 20 December 2002
ER -