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

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

doi:10.1016/S0167-739X(02)00125-5

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

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

^*Corresponding author for this work

Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

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 language	English
Pages (from-to)	493-502
Number of pages	10
Journal	Future Generation Computer Systems
Volume	19
Issue number	4
DOIs	https://doi.org/10.1016/S0167-739X(02)00125-5
Publication status	Published - May 2003
Event	CCGrid 2002 - Berlin, Germany Duration: May 21 2002 → May 24 2002

Keywords

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

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

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

Cite this

@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 = may,

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",

note = "CCGrid 2002 ; Conference date: 21-05-2002 Through 24-05-2002",

}

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 - Conference article

AN - SCOPUS:0037403693

SN - 0167-739X

VL - 19

SP - 493

EP - 502

JO - Future Generation Computer Systems

JF - Future Generation Computer Systems

IS - 4

T2 - CCGrid 2002

Y2 - 21 May 2002 through 24 May 2002

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this