Message latency in the 2-dimensional mesh with wormhole routing

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

Analytical models of deterministic routing in hypercubes and tori with wormhole routing have been widely reported in the literature. Greenberg and Guan (in R. Greenberg, L. Guan, Modelling and comparison of wormhole routed mesh and torus networks, Proc. 9th IASTED Int. Conf. Parallel and Distributed Computing and Systems, October 1997) have recently described a model of deterministic routing in the 2-dimensional mesh, which has been one of the most popular multicomputer networks. Although there have been many adaptive routing algorithms proposed for this network, there has been hardly any study that proposes an analytical model for these algorithms. This paper proposes an approximate analytical model to compute message latency in the mesh with fully-adaptive routing. Results from simulation experiments are then presented to validate the model.

Original languageEnglish
Pages (from-to)509-514
Number of pages6
JournalMicroprocessors and Microsystems
Volume22
Issue number9
DOIs
Publication statusPublished - Mar 29 1999

Fingerprint

Analytical models
Distributed computer systems
Routing algorithms
Parallel processing systems
Adaptive algorithms
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Message latency in the 2-dimensional mesh with wormhole routing. / Ould-Khaoua, M.

In: Microprocessors and Microsystems, Vol. 22, No. 9, 29.03.1999, p. 509-514.

Research output: Contribution to journalArticle

@article{acde8bc312ae47f7a7928bedee5c7be3,
title = "Message latency in the 2-dimensional mesh with wormhole routing",
abstract = "Analytical models of deterministic routing in hypercubes and tori with wormhole routing have been widely reported in the literature. Greenberg and Guan (in R. Greenberg, L. Guan, Modelling and comparison of wormhole routed mesh and torus networks, Proc. 9th IASTED Int. Conf. Parallel and Distributed Computing and Systems, October 1997) have recently described a model of deterministic routing in the 2-dimensional mesh, which has been one of the most popular multicomputer networks. Although there have been many adaptive routing algorithms proposed for this network, there has been hardly any study that proposes an analytical model for these algorithms. This paper proposes an approximate analytical model to compute message latency in the mesh with fully-adaptive routing. Results from simulation experiments are then presented to validate the model.",
author = "M. Ould-Khaoua",
year = "1999",
month = "3",
day = "29",
doi = "10.1016/S0141-9331(98)00114-8",
language = "English",
volume = "22",
pages = "509--514",
journal = "Microprocessors and Microsystems",
issn = "0141-9331",
publisher = "Elsevier",
number = "9",

}

TY - JOUR

T1 - Message latency in the 2-dimensional mesh with wormhole routing

AU - Ould-Khaoua, M.

PY - 1999/3/29

Y1 - 1999/3/29

N2 - Analytical models of deterministic routing in hypercubes and tori with wormhole routing have been widely reported in the literature. Greenberg and Guan (in R. Greenberg, L. Guan, Modelling and comparison of wormhole routed mesh and torus networks, Proc. 9th IASTED Int. Conf. Parallel and Distributed Computing and Systems, October 1997) have recently described a model of deterministic routing in the 2-dimensional mesh, which has been one of the most popular multicomputer networks. Although there have been many adaptive routing algorithms proposed for this network, there has been hardly any study that proposes an analytical model for these algorithms. This paper proposes an approximate analytical model to compute message latency in the mesh with fully-adaptive routing. Results from simulation experiments are then presented to validate the model.

AB - Analytical models of deterministic routing in hypercubes and tori with wormhole routing have been widely reported in the literature. Greenberg and Guan (in R. Greenberg, L. Guan, Modelling and comparison of wormhole routed mesh and torus networks, Proc. 9th IASTED Int. Conf. Parallel and Distributed Computing and Systems, October 1997) have recently described a model of deterministic routing in the 2-dimensional mesh, which has been one of the most popular multicomputer networks. Although there have been many adaptive routing algorithms proposed for this network, there has been hardly any study that proposes an analytical model for these algorithms. This paper proposes an approximate analytical model to compute message latency in the mesh with fully-adaptive routing. Results from simulation experiments are then presented to validate the model.

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

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

U2 - 10.1016/S0141-9331(98)00114-8

DO - 10.1016/S0141-9331(98)00114-8

M3 - Article

VL - 22

SP - 509

EP - 514

JO - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 9

ER -