An analytical model of wormhole-routed hypercubes under broadcast traffic

Abstract

A large number of algorithms have been proposed to support collective communication operations for scalable parallel systems over the past few years. When proposing a new algorithm for a collective communication operation, it is critical to determine its precise scope and evaluate it with accurate modelling of the underlying routing and communication mechanism. However, there has been comparatively little activity in the area of analytical models 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 unicast and broadcast latency in the wormhole-routed hypercube. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.