Message latency in hypercubes in the presence of matrix-transpose traffic

H. Sarbazi-Azad, M. Ould-Khaoua, L. M. Mackenzie

Research output: Contribution to journalArticle

Abstract

Several analytical models of adaptive routing in wormhole-routed networks, including hypercubes, under the uniform traffic pattern have recently been proposed in the literature. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns exhibited by many parallel applications. As a result, most existing studies have resorted to simulation when evaluating the performance merits of adaptive routing under non-uniform traffic conditions. This paper describes a new analytical model of adaptive routing in the hypercube in the presence of non-uniform traffic generated by matrix-transpose permutations, which is used in many matrix computation problems. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.

Original languageEnglish
Pages (from-to)411-419
Number of pages9
JournalComputer Journal
Volume43
Issue number5
DOIs
Publication statusPublished - 2000

Fingerprint

Analytical models
Hypercube networks
Experiments

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

Message latency in hypercubes in the presence of matrix-transpose traffic. / Sarbazi-Azad, H.; Ould-Khaoua, M.; Mackenzie, L. M.

In: Computer Journal, Vol. 43, No. 5, 2000, p. 411-419.

Research output: Contribution to journalArticle

Sarbazi-Azad, H. ; Ould-Khaoua, M. ; Mackenzie, L. M. / Message latency in hypercubes in the presence of matrix-transpose traffic. In: Computer Journal. 2000 ; Vol. 43, No. 5. pp. 411-419.
@article{5ccd345ea99d40c1880dc762dd577983,
title = "Message latency in hypercubes in the presence of matrix-transpose traffic",
abstract = "Several analytical models of adaptive routing in wormhole-routed networks, including hypercubes, under the uniform traffic pattern have recently been proposed in the literature. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns exhibited by many parallel applications. As a result, most existing studies have resorted to simulation when evaluating the performance merits of adaptive routing under non-uniform traffic conditions. This paper describes a new analytical model of adaptive routing in the hypercube in the presence of non-uniform traffic generated by matrix-transpose permutations, which is used in many matrix computation problems. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.",
author = "H. Sarbazi-Azad and M. Ould-Khaoua and Mackenzie, {L. M.}",
year = "2000",
doi = "10.1093/comjnl/43.5.411",
language = "English",
volume = "43",
pages = "411--419",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "5",

}

TY - JOUR

T1 - Message latency in hypercubes in the presence of matrix-transpose traffic

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 2000

Y1 - 2000

N2 - Several analytical models of adaptive routing in wormhole-routed networks, including hypercubes, under the uniform traffic pattern have recently been proposed in the literature. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns exhibited by many parallel applications. As a result, most existing studies have resorted to simulation when evaluating the performance merits of adaptive routing under non-uniform traffic conditions. This paper describes a new analytical model of adaptive routing in the hypercube in the presence of non-uniform traffic generated by matrix-transpose permutations, which is used in many matrix computation problems. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.

AB - Several analytical models of adaptive routing in wormhole-routed networks, including hypercubes, under the uniform traffic pattern have recently been proposed in the literature. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns exhibited by many parallel applications. As a result, most existing studies have resorted to simulation when evaluating the performance merits of adaptive routing under non-uniform traffic conditions. This paper describes a new analytical model of adaptive routing in the hypercube in the presence of non-uniform traffic generated by matrix-transpose permutations, which is used in many matrix computation problems. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.

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

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

U2 - 10.1093/comjnl/43.5.411

DO - 10.1093/comjnl/43.5.411

M3 - Article

VL - 43

SP - 411

EP - 419

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 5

ER -