A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic

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

doi:10.1109/ICPP.2000.876150

A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic

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

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used in the past, it is not always true in practice as there are many applications that exhibit non-uniform traffic patterns. There has not been so far any study that describes an analytical model of fully adaptive routing under permutation traffic patterns. This paper describes a new analytical model of fully adaptive routing in k-ary n-cubes in the presence of non-uniform traffic generated by matrix-transpose permutations, which is an important communication operation found in many matrix computation problems. Results obtained through simulation experiments confirm that the model predicts message latency with a reasonable degree of accuracy under different working conditions.

Original language	English
Title of host publication	Proceedings of the International Conference on Parallel Processing
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	345-352
Number of pages	8
Volume	2000-January
ISBN (Print)	0769507689
DOIs	https://doi.org/10.1109/ICPP.2000.876150
Publication status	Published - 2000
Event	International Conference on Parallel Processing, ICPP 2000 - Toronto, Canada Duration: Aug 21 2000 → Aug 24 2000

Other

Other	International Conference on Parallel Processing, ICPP 2000
Country/Territory	Canada
City	Toronto
Period	8/21/00 → 8/24/00

Keywords

Analytical models
Bandwidth
Computational modeling
Computer science
Delay
Predictive models
Routing
System recovery
Telecommunication traffic
Traffic control

ASJC Scopus subject areas

Software
Mathematics(all)
Hardware and Architecture

Access to Document

10.1109/ICPP.2000.876150

Cite this

A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic. / Sarbazi-Azad, H.; Mackenzie, L. M.; Ould-Khaoua, M.
Proceedings of the International Conference on Parallel Processing. Vol. 2000-January Institute of Electrical and Electronics Engineers Inc., 2000. p. 345-352 876150.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sarbazi-Azad, H, Mackenzie, LM & Ould-Khaoua, M 2000, A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic. in Proceedings of the International Conference on Parallel Processing. vol. 2000-January, 876150, Institute of Electrical and Electronics Engineers Inc., pp. 345-352, International Conference on Parallel Processing, ICPP 2000, Toronto, Canada, 8/21/00. https://doi.org/10.1109/ICPP.2000.876150

@inproceedings{6dcbbe569f95426c8321de13b7e5b005,

title = "A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic",

abstract = "Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used in the past, it is not always true in practice as there are many applications that exhibit non-uniform traffic patterns. There has not been so far any study that describes an analytical model of fully adaptive routing under permutation traffic patterns. This paper describes a new analytical model of fully adaptive routing in k-ary n-cubes in the presence of non-uniform traffic generated by matrix-transpose permutations, which is an important communication operation found in many matrix computation problems. Results obtained through simulation experiments confirm that the model predicts message latency with a reasonable degree of accuracy under different working conditions.",

keywords = "Analytical models, Bandwidth, Computational modeling, Computer science, Delay, Predictive models, Routing, System recovery, Telecommunication traffic, Traffic control",

author = "H. Sarbazi-Azad and Mackenzie, {L. M.} and M. Ould-Khaoua",

year = "2000",

doi = "10.1109/ICPP.2000.876150",

language = "English",

isbn = "0769507689",

volume = "2000-January",

pages = "345--352",

booktitle = "Proceedings of the International Conference on Parallel Processing",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "International Conference on Parallel Processing, ICPP 2000 ; Conference date: 21-08-2000 Through 24-08-2000",

}

TY - GEN

T1 - A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic

AU - Sarbazi-Azad, H.

AU - Mackenzie, L. M.

AU - Ould-Khaoua, M.

PY - 2000

Y1 - 2000

N2 - Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used in the past, it is not always true in practice as there are many applications that exhibit non-uniform traffic patterns. There has not been so far any study that describes an analytical model of fully adaptive routing under permutation traffic patterns. This paper describes a new analytical model of fully adaptive routing in k-ary n-cubes in the presence of non-uniform traffic generated by matrix-transpose permutations, which is an important communication operation found in many matrix computation problems. Results obtained through simulation experiments confirm that the model predicts message latency with a reasonable degree of accuracy under different working conditions.

AB - Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used in the past, it is not always true in practice as there are many applications that exhibit non-uniform traffic patterns. There has not been so far any study that describes an analytical model of fully adaptive routing under permutation traffic patterns. This paper describes a new analytical model of fully adaptive routing in k-ary n-cubes in the presence of non-uniform traffic generated by matrix-transpose permutations, which is an important communication operation found in many matrix computation problems. Results obtained through simulation experiments confirm that the model predicts message latency with a reasonable degree of accuracy under different working conditions.

KW - Analytical models

KW - Bandwidth

KW - Computational modeling

KW - Computer science

KW - Delay

KW - Predictive models

KW - Routing

KW - System recovery

KW - Telecommunication traffic

KW - Traffic control

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

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

U2 - 10.1109/ICPP.2000.876150

DO - 10.1109/ICPP.2000.876150

M3 - Conference contribution

AN - SCOPUS:84949498488

SN - 0769507689

VL - 2000-January

SP - 345

EP - 352

BT - Proceedings of the International Conference on Parallel Processing

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - International Conference on Parallel Processing, ICPP 2000

Y2 - 21 August 2000 through 24 August 2000

ER -

A performance model of adaptive routing in k-ary n-cubes with matrix-transpose traffic

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this