Analysis of k-ary n-cubes with dimension-ordered routing

H. Sarbazi-Azad, A. Khonsari, M. Ould-Khaoua

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

K-ary n-cubes have been one of the most popular interconnection networks for practical multicomputers due to their ease of implementation and ability to exploit communication locality found in many parallel applications. This paper describes an analytical model for k-ary n-cubes with dimension-ordered routing. The main feature of the model is its ability to captures network performance when an arbitrary number of virtual channels are used to reduce message blocking. Simulation experiments reveal that the latency results predicted by the analytical model are in good agreement with those provided by the simulation model.

Original languageEnglish
Pages (from-to)493-502
Number of pages10
JournalFuture Generation Computer Systems
Volume19
Issue number4
DOIs
Publication statusPublished - May 2003

Keywords

  • Dimension-ordered routing
  • M/G/1 queuing systems
  • Message latency
  • Multicomputer networks
  • Virtual channel multiplexing

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Analysis of k-ary n-cubes with dimension-ordered routing'. Together they form a unique fingerprint.

  • Cite this