A simple mathematical model of adaptive routing in wormhole k-ary n-cubes

H. Sarbazi-Azad, M. Ould-Khaoua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. This model requires a running time of O(1) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.

Original languageEnglish
Title of host publicationProceedings of the ACM Symposium on Applied Computing
Pages835-839
Number of pages5
Publication statusPublished - 2002
EventApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain
Duration: Mar 11 2002Mar 14 2002

Other

OtherApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing
CountrySpain
CityMadrid
Period3/11/023/14/02

Fingerprint

Mathematical models
Adaptive algorithms
Analytical models

Keywords

  • Adaptive routing
  • Interconnection networks
  • k-Ary n-cubes
  • Performance modelling
  • Wormhole switching

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Sarbazi-Azad, H., & Ould-Khaoua, M. (2002). A simple mathematical model of adaptive routing in wormhole k-ary n-cubes. In Proceedings of the ACM Symposium on Applied Computing (pp. 835-839)

A simple mathematical model of adaptive routing in wormhole k-ary n-cubes. / Sarbazi-Azad, H.; Ould-Khaoua, M.

Proceedings of the ACM Symposium on Applied Computing. 2002. p. 835-839.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sarbazi-Azad, H & Ould-Khaoua, M 2002, A simple mathematical model of adaptive routing in wormhole k-ary n-cubes. in Proceedings of the ACM Symposium on Applied Computing. pp. 835-839, Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain, 3/11/02.
Sarbazi-Azad H, Ould-Khaoua M. A simple mathematical model of adaptive routing in wormhole k-ary n-cubes. In Proceedings of the ACM Symposium on Applied Computing. 2002. p. 835-839
Sarbazi-Azad, H. ; Ould-Khaoua, M. / A simple mathematical model of adaptive routing in wormhole k-ary n-cubes. Proceedings of the ACM Symposium on Applied Computing. 2002. pp. 835-839
@inproceedings{d780063411574d7cbc2d5877d5719230,
title = "A simple mathematical model of adaptive routing in wormhole k-ary n-cubes",
abstract = "Many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. This model requires a running time of O(1) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.",
keywords = "Adaptive routing, Interconnection networks, k-Ary n-cubes, Performance modelling, Wormhole switching",
author = "H. Sarbazi-Azad and M. Ould-Khaoua",
year = "2002",
language = "English",
pages = "835--839",
booktitle = "Proceedings of the ACM Symposium on Applied Computing",

}

TY - GEN

T1 - A simple mathematical model of adaptive routing in wormhole k-ary n-cubes

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

PY - 2002

Y1 - 2002

N2 - Many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. This model requires a running time of O(1) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.

AB - Many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. This model requires a running time of O(1) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.

KW - Adaptive routing

KW - Interconnection networks

KW - k-Ary n-cubes

KW - Performance modelling

KW - Wormhole switching

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

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

M3 - Conference contribution

SP - 835

EP - 839

BT - Proceedings of the ACM Symposium on Applied Computing

ER -