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)

Abstract

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
Volume22
Issue number2
DOIs
Publication statusPublished - Jun 2002

Fingerprint

Wormhole Routing
K-ary N-cubes
Adaptive Routing
Performance Model
Reversal
Digit
Analytical models
Traffic
Analytical Model
Matrix Computation
Wormhole
Non-uniformity
Reference Model
Simulation Experiment
Latency
Permutation
Communication
Predict
Experiments

Keywords

  • 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

A performance model of adaptive wormhole routing in k-ary n-cubes in the presence of digit-reversal traffic. / Sarbazi-Azad, Hamid; Ould-Khaoua, Mohamed; Mackenzie, Lewis M.

In: Journal of Supercomputing, Vol. 22, No. 2, 06.2002, p. 139-159.

Research output: Contribution to journalArticle

@article{1c2026fe2b3141e0b5d635eb2bacebaa,
title = "A performance model of adaptive wormhole routing in k-ary n-cubes in the presence of digit-reversal traffic",
abstract = "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.",
keywords = "Adaptive wormhole routing, Digit-reversal permutation, Interconnection networks, k-ary n-cubes, Multicomputers, Nonuniform traffic, Performance modeling",
author = "Hamid Sarbazi-Azad and Mohamed Ould-Khaoua and Mackenzie, {Lewis M.}",
year = "2002",
month = "6",
doi = "10.1023/A:1014984417525",
language = "English",
volume = "22",
pages = "139--159",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

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

AU - Sarbazi-Azad, Hamid

AU - Ould-Khaoua, Mohamed

AU - Mackenzie, Lewis M.

PY - 2002/6

Y1 - 2002/6

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

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

KW - Adaptive wormhole routing

KW - Digit-reversal permutation

KW - Interconnection networks

KW - k-ary n-cubes

KW - Multicomputers

KW - Nonuniform traffic

KW - Performance modeling

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

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

U2 - 10.1023/A:1014984417525

DO - 10.1023/A:1014984417525

M3 - Article

VL - 22

SP - 139

EP - 159

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

IS - 2

ER -