Latency of double-tree broadcast in wormhole-routed hypercubes

Several analytical models have been proposed in the literature for wormhole-routed multicomputers. However, all these models have been discussed in the context of unicast communication and there has been comparatively little activity in the area of analytical modelling of collective communication algorithms like broadcast. This paper presents an analytical model for predicting latency of broadcast messages in wormhole-routed hypercubes. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting broadcast latency under different working conditions.