Analytical modelling of broadcast in adaptive wormhole-routed hypercubes

Many analytical models of wormhole-routed networks have been proposed over the past few years. Most of these models, however, have been developed for unicast (or point-to-point) communication. There has been comparatively little activity in the area of analytical models of collective communication, such as broadcast. 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 hypercube. The broadcast algorithm considered in this study is based on the unicast-based approach and described [IEEE Trans. Parallel Distrib. Syst. 5 (1994) 1252]. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.