A performance model for Duato's fully adaptive routing algorithm in k-Ary n-cubes

Research output: Contribution to journalArticle

92 Citations (Scopus)

Abstract

Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm [10]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

Original languageEnglish
Pages (from-to)1297-1304
Number of pages8
JournalIEEE Transactions on Computers
Volume48
Issue number12
DOIs
Publication statusPublished - Dec 1999

Fingerprint

K-ary N-cubes
Adaptive Routing
Performance Model
Routing algorithms
Routing Algorithm
Adaptive algorithms
Adaptive Algorithm
Analytical Model
Analytical models
Routing
Wormhole
Simulation Experiment
Latency
Experiments
Model

Keywords

  • Adaptive routing
  • Deterministic routing
  • Interconnection networks
  • Message latency
  • Multicomputers
  • Performance modeling
  • Virtual channels

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

A performance model for Duato's fully adaptive routing algorithm in k-Ary n-cubes. / Ould-Khaoua, Mohamed.

In: IEEE Transactions on Computers, Vol. 48, No. 12, 12.1999, p. 1297-1304.

Research output: Contribution to journalArticle

@article{bfd0485c53a048a2bce6d28dc4e3b9f7,
title = "A performance model for Duato's fully adaptive routing algorithm in k-Ary n-cubes",
abstract = "Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm [10]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.",
keywords = "Adaptive routing, Deterministic routing, Interconnection networks, Message latency, Multicomputers, Performance modeling, Virtual channels",
author = "Mohamed Ould-Khaoua",
year = "1999",
month = "12",
doi = "10.1109/12.817384",
language = "English",
volume = "48",
pages = "1297--1304",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "12",

}

TY - JOUR

T1 - A performance model for Duato's fully adaptive routing algorithm in k-Ary n-cubes

AU - Ould-Khaoua, Mohamed

PY - 1999/12

Y1 - 1999/12

N2 - Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm [10]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

AB - Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm [10]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

KW - Adaptive routing

KW - Deterministic routing

KW - Interconnection networks

KW - Message latency

KW - Multicomputers

KW - Performance modeling

KW - Virtual channels

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

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

U2 - 10.1109/12.817384

DO - 10.1109/12.817384

M3 - Article

AN - SCOPUS:0033349053

VL - 48

SP - 1297

EP - 1304

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 12

ER -