A performance model of disha routing in k-ary n-cube networks

A. Khonsari*, A. Shahrabi, M. Ould-Khaoua

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance, e.g. Duato's routing. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable improvement in network performance. Disha is an example of a true fully. adaptive routing algorithm that uses minimal hardware to implement a simple and efficient progressive method to recover from potential deadlocks. This paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various networks sizes and under different traffic conditions.

Original languageEnglish
Pages (from-to)213-228
Number of pages16
JournalParallel Processing Letters
Issue number2
Publication statusPublished - Jun 2007
Externally publishedYes


  • Adaptive routing
  • Deadlock
  • M/G/1 queues
  • Multicomputers
  • Simulation

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture


Dive into the research topics of 'A performance model of disha routing in k-ary n-cube networks'. Together they form a unique fingerprint.

Cite this