Message latency in the 2-dimensional mesh with wormhole routing

M. Ould-Khaoua

doi:10.1016/S0141-9331(98)00114-8

Message latency in the 2-dimensional mesh with wormhole routing

M. Ould-Khaoua^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	509-514
Number of pages	6
Journal	Microprocessors and Microsystems
Volume	22
Issue number	9
DOIs	https://doi.org/10.1016/S0141-9331(98)00114-8
Publication status	Published - Mar 29 1999
Externally published	Yes

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1016/S0141-9331(98)00114-8

Cite this

@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 = mar,

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

AN - SCOPUS:0344286003

SN - 0141-9331

VL - 22

SP - 509

EP - 514

JO - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

IS - 9

ER -

Message latency in the 2-dimensional mesh with wormhole routing

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this