Several analytical models of deterministic routing in wormhoie-routed k-ary n-cubes have already been reported in the literature. The performance characteristics of most fully-adaptive routing algorithms have often been analyzed by means of simulation and there is hardly any analytical model proposed for calculating message latency in wormhoie-routed k-ary n-cubes using adaptive routing. This paper proposes an accurate analytical model to predict the message latency in wormhoie-routed k-ary n-cubes with fully-adaptive routing. The proposed model is general in that it exhibits a good degree of accuracy for various network configurations and under different operating conditions.
|الصفحات (من إلى)||249-255|
|دورية||Proceedings of the International Conference on Parallel Processing|
|المعرِّفات الرقمية للأشياء|
|حالة النشر||Published - 1999|
|الحدث||1999 lnternational Workshops on Parallel Processing, ICPP 1999 - Aizu-Wakamatsu, Japan|
المدة: سبتمبر ٢٤ ١٩٩٩ → …
ASJC Scopus subject areas