2004 IEEE International Conference on Computer Design (ICCD'04) An Accurate Combinatorial Model for Performance Prediction of Deterministic Wormhole Routing in Torus Multicomputer Systems San Jose, CA October 11-October 13 ISBN: 0-7695-2231-9
Although several analytical models have been proposed in the literature for different interconnection networks with deterministic routing, very few of them have considered the effects of virtual channel multiplexing on network performance. This paper proposes a new analytical model to compute message latency in a general n-dimensional torus network with an arbitrary number of virtual channels per physical channel. Unlike the previous models proposed for toroidal-based networks, this model uses a combinatorial approach to consider all different possible cases for the source-destination pairs, thus resulting in an accurate prediction. The results obtained from simulation experiments confirm that the proposed model exhibits a high degree of accuracy for various network sizes, under different operating conditions, compared to a similar model proposed very recently [Analysis of k-ary n-cubes with dimension-ordered routing], which considers virtual channel utilization in the k-ary n-cube network.
Citation:
H. H. Najaf-abadi, H. Sarbazi-azad, "An Accurate Combinatorial Model for Performance Prediction of Deterministic Wormhole Routing in Torus Multicomputer Systems," iccd, pp.548-553, 2004 IEEE International Conference on Computer Design (ICCD'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||