The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Analytical models of deterministic routing in wormhole-routed <tmath>$k$</tmath>-ary <tmath>$n$</tmath>-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 <tmath>$k$</tmath>-ary <tmath>$n$</tmath>-cubes with fully adaptive routing, based on Duato's algorithm [<ref type="bib" rid="bibT129710">10</ref>]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.</p>
Multicomputers, interconnection networks, adaptive routing, deterministic routing, virtual channels, message latency, performance modeling.
Mohamed Ould-Khaoua, "A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$-Ary n$n$-Cubes", IEEE Transactions on Computers, vol. 48, no. , pp. 1297-1304, December 1999, doi:10.1109/12.817384
45 ms
(Ver 3.3 (11022016))