Analytic performance modeling of a fully adaptive routing algorithm in the torus

Abstract

Over the past decade, many fully adaptive routing algorithms have been proposed in the literature, of which Duato's routing algorithm has gained considerable attention for analytical modeling. In this study we propose an analytical model to predict message latency in wormhole routed 2-dimensional torus networks in which fully adaptive routing, based on Linderr-Harden's methodology [10], is employed. This methodology presents a framework in which adaptive routing algorithms can be developed for the k-ary n-cube network. Simulation experiments reveal that the latency results predicted by the proposed analytical model are in good agreement with those provided by simulation experiments. © Springer-Verlag Berlin Heidelberg 2005.