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

Mohamed Ould-Khaoua*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

92 Citations (SciVal)


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 [10]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

Original languageEnglish
Pages (from-to)1297-1304
Number of pages8
JournalIEEE Transactions on Computers
Issue number12
Publication statusPublished - Dec 1999
Externally publishedYes


  • Adaptive routing
  • Deterministic routing
  • Interconnection networks
  • Message latency
  • Multicomputers
  • Performance modeling
  • Virtual channels

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'A performance model for Duato's fully adaptive routing algorithm in k-Ary n-cubes'. Together they form a unique fingerprint.

Cite this