Message latency in k-ary n-cubes with hop-based routing

Many adaptive routing algorithms for wormhole-routed k-ary n-cubes have been proposed to overcome the performance limitations of deterministic routing. However, before such routing schemes can be successfully incorporated in future practical multicomputers, it is necessary to develop a clear understanding of the factors that affect their potential performance. R.V. Boppanna and S.S. Chalasani (1996) have recently proposed a routing algorithm (referred to as hop-based routing) that achieves full adaptivity in wormhole-routed k-ary n-cubes using a hop-based scheme borrowed from traditional store-and-forward networks. A new analytical model is prepared to compute message latency in k-ary n-cubes with hop-based routing. Results from simulation experiments reveal that the proposed model exhibits a good degree of accuracy in predicting message latency