TY - JOUR
T1 - Performance modelling of broadcast communication in multicomputer networks
AU - Shahrabi, A.
AU - Ould-Khaoua, M.
AU - MacKenzie, L. M.
PY - 2005/3
Y1 - 2005/3
N2 - Over the past few years, many algorithms have been proposed to support collective communication operations for large-scale multicomputers. When proposing any new such algorithm operation, it is critical to determine its precise scope and evaluate it with accurate modelling of the underlying routing and communication mechanisms. However, there has been comparatively little activity in the area of analytical modelling of these operations. As a result, most existing studies have relied on simulation to evaluate the performance merits of collective communication algorithms. This paper presents a new analytical model for predicting broadcast latency in the wormhole-routed torus, which is one of the most common networks used in multicomputers. The broadcast algorithm considered in this study is based on the Bose's broadcast algorithm [Bose, B., Broeg, B., Younggeun, K. and Ashir, Y., 1995, Lee distance and topological properties of k-ary n-cubes, IEEE Transaction on Computers, 44(8), 1021-1030]. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.
AB - Over the past few years, many algorithms have been proposed to support collective communication operations for large-scale multicomputers. When proposing any new such algorithm operation, it is critical to determine its precise scope and evaluate it with accurate modelling of the underlying routing and communication mechanisms. However, there has been comparatively little activity in the area of analytical modelling of these operations. As a result, most existing studies have relied on simulation to evaluate the performance merits of collective communication algorithms. This paper presents a new analytical model for predicting broadcast latency in the wormhole-routed torus, which is one of the most common networks used in multicomputers. The broadcast algorithm considered in this study is based on the Bose's broadcast algorithm [Bose, B., Broeg, B., Younggeun, K. and Ashir, Y., 1995, Lee distance and topological properties of k-ary n-cubes, IEEE Transaction on Computers, 44(8), 1021-1030]. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.
KW - Adaptive routing
KW - Broadcast operation
KW - Interconnection networks
KW - Latency
KW - Multicomputers
KW - Wormhole routing
UR - http://www.scopus.com/inward/record.url?scp=27844599759&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27844599759&partnerID=8YFLogxK
U2 - 10.1080/17445760500033325
DO - 10.1080/17445760500033325
M3 - Article
AN - SCOPUS:27844599759
SN - 1744-5760
VL - 20
SP - 21
EP - 37
JO - International Journal of Parallel, Emergent and Distributed Systems
JF - International Journal of Parallel, Emergent and Distributed Systems
IS - 1
ER -