TY - GEN
T1 - On the design of scalable pipelined broadcasting for mesh networks
AU - Al-Dubai, Ahmed Y.
AU - Ould-Khaoua, Mohamed
N1 - Publisher Copyright:
© 2002 IEEE.
PY - 2002
Y1 - 2002
N2 - Minimising the communication latency and achieving considerable scalability are of paramount importance when designing high performance broadcast algorithms. Many algorithms for wormhole-switched meshes have been widely reported in the literature. However, most of these algorithms handle broadcast in a sequential manner and do not scale well with the network size. As a consequence, many parallel applications cannot be efficiently supported using existing algorithms. Motivated by these observations, this paper presents a new broadcast algorithm for the all-port mesh networks. The unique feature of the proposed algorithm is its capability of handling broadcast in only one message-passing step irrespective of the network size. Results from a comparative analysis and simulation reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node and Network Partitioning algorithms.
AB - Minimising the communication latency and achieving considerable scalability are of paramount importance when designing high performance broadcast algorithms. Many algorithms for wormhole-switched meshes have been widely reported in the literature. However, most of these algorithms handle broadcast in a sequential manner and do not scale well with the network size. As a consequence, many parallel applications cannot be efficiently supported using existing algorithms. Motivated by these observations, this paper presents a new broadcast algorithm for the all-port mesh networks. The unique feature of the proposed algorithm is its capability of handling broadcast in only one message-passing step irrespective of the network size. Results from a comparative analysis and simulation reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node and Network Partitioning algorithms.
UR - http://www.scopus.com/inward/record.url?scp=84949908118&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84949908118&partnerID=8YFLogxK
U2 - 10.1109/HPCSA.2002.1019140
DO - 10.1109/HPCSA.2002.1019140
M3 - Conference contribution
AN - SCOPUS:84949908118
T3 - Proceedings - International Symposium on High Performance Computing Systems and Applications
SP - 98
EP - 105
BT - Proceedings - 16th Annual International Symposium on High Performance Computing Systems and Applications, HPCS 2002
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 16th Annual International Symposium on High Performance Computing Systems and Applications, HPCS 2002
Y2 - 16 June 2002 through 19 June 2002
ER -