Performance modeling of fully adaptive wormhole routing in n-dimensional mesh-connected multicomputers

Many analytical performance models for k-ary n-cube networks have been reported in the literature. However, the inherent asymmetry of the mesh topology (k-ary n-cubes without wraparounds) renders derivation of an analytical model for this class of networks more challenging. As a consequence, very few analytical models have been proposed for wormhole routed 2-D mesh networks, and there has been to the best of our knowledge, no analytical performance model proposed for n-D mesh networks. To address this shortcoming, this paper proposes the first analytical performance model for n-D mesh networks employing fully adaptive wormhole routing. Simulation results show that this model is able to predict message latency with a good degree of accuracy, thus providing designers and researchers with a useful tool for the study and analysis of performance issues in mesh-based multicomputer systems