A performance model for Duato's fully adaptive routing algorithm in k-ary n-cubes

Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm (1998). The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.