Message latency in k-ary n-cubes with hop-based routing

S. Loucif, H. Sarbazi-Azad, M. Ould-Khaoua

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Many adaptive routing algorithms for wormhole-routed k-ary n-cubes have been proposed to overcome the performance limitations of deterministic routing. However, before such routing schemes can be successfully incorporated in future practical multicomputers, it is necessary to develop a clear understanding of the factors that affect their potential performance. Boppanna and Chalasani have recently proposed a routing algorithm (referred to as hop-based routing) that achieves full adaptivity in wormhole-routed k-ary n-cubes using a hop-based scheme borrowed from traditional store-and forward networks. A new analytical model is prepared to compute message latency in k-ary n-cubes with hop-based routing. Results from simulation experiments reveal that the proposed model exhibits a good degree of accuracy in predicting message latency.

Original languageEnglish
Pages (from-to)89-94
Number of pages6
JournalIEE Proceedings: Computers and Digital Techniques
Volume148
Issue number2
DOIs
Publication statusPublished - Mar 2001

Fingerprint

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

ASJC Scopus subject areas

  • Hardware and Architecture
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Message latency in k-ary n-cubes with hop-based routing. / Loucif, S.; Sarbazi-Azad, H.; Ould-Khaoua, M.

In: IEE Proceedings: Computers and Digital Techniques, Vol. 148, No. 2, 03.2001, p. 89-94.

Research output: Contribution to journalArticle

@article{de6cf41ae145486886b81060832a0983,
title = "Message latency in k-ary n-cubes with hop-based routing",
abstract = "Many adaptive routing algorithms for wormhole-routed k-ary n-cubes have been proposed to overcome the performance limitations of deterministic routing. However, before such routing schemes can be successfully incorporated in future practical multicomputers, it is necessary to develop a clear understanding of the factors that affect their potential performance. Boppanna and Chalasani have recently proposed a routing algorithm (referred to as hop-based routing) that achieves full adaptivity in wormhole-routed k-ary n-cubes using a hop-based scheme borrowed from traditional store-and forward networks. A new analytical model is prepared to compute message latency in k-ary n-cubes with hop-based routing. Results from simulation experiments reveal that the proposed model exhibits a good degree of accuracy in predicting message latency.",
author = "S. Loucif and H. Sarbazi-Azad and M. Ould-Khaoua",
year = "2001",
month = "3",
doi = "10.1049/ip-cdt:20010251",
language = "English",
volume = "148",
pages = "89--94",
journal = "IEE Proceedings: Computers and Digital Techniques",
issn = "1350-2387",
publisher = "Institute of Electrical Engineers",
number = "2",

}

TY - JOUR

T1 - Message latency in k-ary n-cubes with hop-based routing

AU - Loucif, S.

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

PY - 2001/3

Y1 - 2001/3

N2 - Many adaptive routing algorithms for wormhole-routed k-ary n-cubes have been proposed to overcome the performance limitations of deterministic routing. However, before such routing schemes can be successfully incorporated in future practical multicomputers, it is necessary to develop a clear understanding of the factors that affect their potential performance. Boppanna and Chalasani have recently proposed a routing algorithm (referred to as hop-based routing) that achieves full adaptivity in wormhole-routed k-ary n-cubes using a hop-based scheme borrowed from traditional store-and forward networks. A new analytical model is prepared to compute message latency in k-ary n-cubes with hop-based routing. Results from simulation experiments reveal that the proposed model exhibits a good degree of accuracy in predicting message latency.

AB - Many adaptive routing algorithms for wormhole-routed k-ary n-cubes have been proposed to overcome the performance limitations of deterministic routing. However, before such routing schemes can be successfully incorporated in future practical multicomputers, it is necessary to develop a clear understanding of the factors that affect their potential performance. Boppanna and Chalasani have recently proposed a routing algorithm (referred to as hop-based routing) that achieves full adaptivity in wormhole-routed k-ary n-cubes using a hop-based scheme borrowed from traditional store-and forward networks. A new analytical model is prepared to compute message latency in k-ary n-cubes with hop-based routing. Results from simulation experiments reveal that the proposed model exhibits a good degree of accuracy in predicting message latency.

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

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

U2 - 10.1049/ip-cdt:20010251

DO - 10.1049/ip-cdt:20010251

M3 - Article

AN - SCOPUS:0035268660

VL - 148

SP - 89

EP - 94

JO - IEE Proceedings: Computers and Digital Techniques

JF - IEE Proceedings: Computers and Digital Techniques

SN - 1350-2387

IS - 2

ER -