A performance model of adaptive wormhole routing in k-ary n-cubes in the presence of digit-reversal traffic

Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie

Research output: Contribution to journalArticle

3 Citations (Scopus)


Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used by researchers, it is not always true in practice as there are many applications that exhibit traffic nonuniformity. There has hardly been any study that describes an analytical model of fully adaptive routing under nonuniform traffic conditions. This paper describes the first analytical model of fully adaptive routing in k-ary n-cubes in the presence of nonuniform traffic generated by the digit-reversal permutation, which is an important communication operation found in many matrix computation problems. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.

Original languageEnglish
Pages (from-to)139-159
Number of pages21
JournalJournal of Supercomputing
Issue number2
Publication statusPublished - Jun 2002



  • Adaptive wormhole routing
  • Digit-reversal permutation
  • Interconnection networks
  • k-ary n-cubes
  • Multicomputers
  • Nonuniform traffic
  • Performance modeling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this