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

Fingerprint

Analytical models
Network performance
Communication
Experiments

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

Cite this

Analysis of k-ary n-cubes with dimension-ordered routing. / Sarbazi-Azad, H.; Khonsari, A.; Ould-Khaoua, M.

In: Future Generation Computer Systems, Vol. 19, No. 4, 05.2003, p. 493-502.

Research output: Contribution to journalArticle

Sarbazi-Azad, H. ; Khonsari, A. ; Ould-Khaoua, M. / Analysis of k-ary n-cubes with dimension-ordered routing. In: Future Generation Computer Systems. 2003 ; Vol. 19, No. 4. pp. 493-502.
@article{754649c76ca1415798c4f9e0aeedeabd,
title = "Analysis of k-ary n-cubes with dimension-ordered routing",
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.",
keywords = "Dimension-ordered routing, M/G/1 queuing systems, Message latency, Multicomputer networks, Virtual channel multiplexing",
author = "H. Sarbazi-Azad and A. Khonsari and M. Ould-Khaoua",
year = "2003",
month = "5",
doi = "10.1016/S0167-739X(02)00125-5",
language = "English",
volume = "19",
pages = "493--502",
journal = "Future Generation Computer Systems",
issn = "0167-739X",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

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

AU - Sarbazi-Azad, H.

AU - Khonsari, A.

AU - Ould-Khaoua, M.

PY - 2003/5

Y1 - 2003/5

N2 - 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.

AB - 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.

KW - Dimension-ordered routing

KW - M/G/1 queuing systems

KW - Message latency

KW - Multicomputer networks

KW - Virtual channel multiplexing

UR - http://www.scopus.com/inward/record.url?scp=0037403693&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037403693&partnerID=8YFLogxK

U2 - 10.1016/S0167-739X(02)00125-5

DO - 10.1016/S0167-739X(02)00125-5

M3 - Article

VL - 19

SP - 493

EP - 502

JO - Future Generation Computer Systems

JF - Future Generation Computer Systems

SN - 0167-739X

IS - 4

ER -