Analysis of fully adaptive wormhole routing in tori

S. Loucif, M. Ould-Khaoua, L. M. Mackenzie

Research output: Contribution to journalArticle

34 Citations (Scopus)

Abstract

A model of adaptive routing in the hypercube has recently been proposed. Modelling adaptive routing in a high-radix k-ary n-cube, e.g., the torus, is more complicated than in the hypercube since a message in the former may cross more than one channel along a given dimension. This paper proposes a queuing model of adaptive routing in the torus. The validity of the model is demonstrated by comparing analytical results with those obtained through simulations.

Original languageEnglish
Pages (from-to)1477-1487
Number of pages11
JournalParallel Computing
Volume25
Issue number12
DOIs
Publication statusPublished - Nov 1999

Fingerprint

Wormhole Routing
Adaptive Routing
Torus
Hypercube
K-ary N-cubes
Queuing Model
Modeling
Model
Simulation

ASJC Scopus subject areas

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

Cite this

Analysis of fully adaptive wormhole routing in tori. / Loucif, S.; Ould-Khaoua, M.; Mackenzie, L. M.

In: Parallel Computing, Vol. 25, No. 12, 11.1999, p. 1477-1487.

Research output: Contribution to journalArticle

Loucif, S. ; Ould-Khaoua, M. ; Mackenzie, L. M. / Analysis of fully adaptive wormhole routing in tori. In: Parallel Computing. 1999 ; Vol. 25, No. 12. pp. 1477-1487.
@article{705bfc43d37e4a5aa85d17b6a78cc770,
title = "Analysis of fully adaptive wormhole routing in tori",
abstract = "A model of adaptive routing in the hypercube has recently been proposed. Modelling adaptive routing in a high-radix k-ary n-cube, e.g., the torus, is more complicated than in the hypercube since a message in the former may cross more than one channel along a given dimension. This paper proposes a queuing model of adaptive routing in the torus. The validity of the model is demonstrated by comparing analytical results with those obtained through simulations.",
author = "S. Loucif and M. Ould-Khaoua and Mackenzie, {L. M.}",
year = "1999",
month = "11",
doi = "10.1016/S0167-8191(99)00062-9",
language = "English",
volume = "25",
pages = "1477--1487",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "12",

}

TY - JOUR

T1 - Analysis of fully adaptive wormhole routing in tori

AU - Loucif, S.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 1999/11

Y1 - 1999/11

N2 - A model of adaptive routing in the hypercube has recently been proposed. Modelling adaptive routing in a high-radix k-ary n-cube, e.g., the torus, is more complicated than in the hypercube since a message in the former may cross more than one channel along a given dimension. This paper proposes a queuing model of adaptive routing in the torus. The validity of the model is demonstrated by comparing analytical results with those obtained through simulations.

AB - A model of adaptive routing in the hypercube has recently been proposed. Modelling adaptive routing in a high-radix k-ary n-cube, e.g., the torus, is more complicated than in the hypercube since a message in the former may cross more than one channel along a given dimension. This paper proposes a queuing model of adaptive routing in the torus. The validity of the model is demonstrated by comparing analytical results with those obtained through simulations.

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

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

U2 - 10.1016/S0167-8191(99)00062-9

DO - 10.1016/S0167-8191(99)00062-9

M3 - Article

VL - 25

SP - 1477

EP - 1487

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 12

ER -