Performance analysis of k-ary n-cubes with fully adaptive routing

H. Sarbazi-Azad, M. Ould-Khaoua, L. M. Mackenzie

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Article number857705
Pages (from-to)249-255
Number of pages7
JournalProceedings of the International Conference on Parallel Processing
Publication statusPublished - 1999
Externally publishedYes
Event1999 lnternational Workshops on Parallel Processing, ICPP 1999 - Aizu-Wakamatsu, Japan
Duration: Sept 24 1999 → …

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture


Dive into the research topics of 'Performance analysis of k-ary n-cubes with fully adaptive routing'. Together they form a unique fingerprint.

Cite this