Modelling and evaluation of adaptive routing in high-performance n-D tori networks

H. Sarbazi-Azad, M. Ould-Khaoua

Research output: Contribution to journalArticle

Abstract

Many fully-adaptive algorithms have been proposed to overcome the performance limitations of deterministic routing in networks used in high-performance multicomputers, such as the well-known regular n-D torus. This paper proposes a simple yet reasonably accurate analytical performance model to predict message communication latency in tori networks. This model requires a running time of O(1) which is the fastest model yet reported in the literature. Extensive simulations reveal that the new performance model maintains a reasonable accuracy when the network operates under different traffic conditions. The model is then used to perform an extensive investigation into the performance merits of n-D tori using adaptive routing and virtual channels.

Original languageEnglish
Pages (from-to)740-751
Number of pages12
JournalSimulation Modelling Practice and Theory
Volume14
Issue number6
DOIs
Publication statusPublished - Aug 2006

Fingerprint

Adaptive Routing
Torus
High Performance
Performance Model
Evaluation
Modeling
Virtual Channel
Multicomputers
Adaptive Algorithm
Analytical Model
Latency
Routing
Traffic
Model
Predict
Adaptive algorithms
High performance
Simulation
Communication

Keywords

  • Adaptive wormhole routing
  • Analytic models
  • Interconnection networks
  • Multicomputers
  • Performance analysis
  • Tori
  • Virtual channels

ASJC Scopus subject areas

  • Information Systems and Management
  • Applied Mathematics
  • Control and Optimization
  • Modelling and Simulation

Cite this

Modelling and evaluation of adaptive routing in high-performance n-D tori networks. / Sarbazi-Azad, H.; Ould-Khaoua, M.

In: Simulation Modelling Practice and Theory, Vol. 14, No. 6, 08.2006, p. 740-751.

Research output: Contribution to journalArticle

@article{4d3716411e584a4e94e1ff101b82ba1a,
title = "Modelling and evaluation of adaptive routing in high-performance n-D tori networks",
abstract = "Many fully-adaptive algorithms have been proposed to overcome the performance limitations of deterministic routing in networks used in high-performance multicomputers, such as the well-known regular n-D torus. This paper proposes a simple yet reasonably accurate analytical performance model to predict message communication latency in tori networks. This model requires a running time of O(1) which is the fastest model yet reported in the literature. Extensive simulations reveal that the new performance model maintains a reasonable accuracy when the network operates under different traffic conditions. The model is then used to perform an extensive investigation into the performance merits of n-D tori using adaptive routing and virtual channels.",
keywords = "Adaptive wormhole routing, Analytic models, Interconnection networks, Multicomputers, Performance analysis, Tori, Virtual channels",
author = "H. Sarbazi-Azad and M. Ould-Khaoua",
year = "2006",
month = "8",
doi = "10.1016/j.simpat.2005.10.008",
language = "English",
volume = "14",
pages = "740--751",
journal = "Simulation Modelling Practice and Theory",
issn = "1569-190X",
publisher = "Elsevier",
number = "6",

}

TY - JOUR

T1 - Modelling and evaluation of adaptive routing in high-performance n-D tori networks

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

PY - 2006/8

Y1 - 2006/8

N2 - Many fully-adaptive algorithms have been proposed to overcome the performance limitations of deterministic routing in networks used in high-performance multicomputers, such as the well-known regular n-D torus. This paper proposes a simple yet reasonably accurate analytical performance model to predict message communication latency in tori networks. This model requires a running time of O(1) which is the fastest model yet reported in the literature. Extensive simulations reveal that the new performance model maintains a reasonable accuracy when the network operates under different traffic conditions. The model is then used to perform an extensive investigation into the performance merits of n-D tori using adaptive routing and virtual channels.

AB - Many fully-adaptive algorithms have been proposed to overcome the performance limitations of deterministic routing in networks used in high-performance multicomputers, such as the well-known regular n-D torus. This paper proposes a simple yet reasonably accurate analytical performance model to predict message communication latency in tori networks. This model requires a running time of O(1) which is the fastest model yet reported in the literature. Extensive simulations reveal that the new performance model maintains a reasonable accuracy when the network operates under different traffic conditions. The model is then used to perform an extensive investigation into the performance merits of n-D tori using adaptive routing and virtual channels.

KW - Adaptive wormhole routing

KW - Analytic models

KW - Interconnection networks

KW - Multicomputers

KW - Performance analysis

KW - Tori

KW - Virtual channels

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

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

U2 - 10.1016/j.simpat.2005.10.008

DO - 10.1016/j.simpat.2005.10.008

M3 - Article

VL - 14

SP - 740

EP - 751

JO - Simulation Modelling Practice and Theory

JF - Simulation Modelling Practice and Theory

SN - 1569-190X

IS - 6

ER -