ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
Hi-index | 0.00 |
Several analytical models of deterministic routing in wormhole-routed k-ary n-cubes have already been reported in the literature. The performance characteristics of most fully adaptive routing algorithms have often been analyzed by means of simulation and there is hardly any analytical model proposed for calculating message latency in wormhole-routed k-ary n-cubes using adaptive routing. This paper proposes an accurate analytical model to predict the message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. The proposed model is general in that it exhibits a good degree of accuracy for various network configurations and under different operating conditions.