Performance analysis of k-ary n-cubes with fully adaptive routing

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

doi:10.1109/ICPADS.2000.857705

Performance analysis of k-ary n-cubes with fully adaptive routing

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

Research output: Contribution to journal › Conference article › peer-review

1 Citation (Scopus)

Abstract

Several analytical models of deterministic routing in wormhoie-routed k-ary n-cubes have already been reported in the literature. The performance characteristics of most fully-adaptive routing algorithms have often been analyzed by means of simulation and there is hardly any analytical model proposed for calculating message latency in wormhoie-routed k-ary n-cubes using adaptive routing. This paper proposes an accurate analytical model to predict the message latency in wormhoie-routed k-ary n-cubes with fully-adaptive routing. The proposed model is general in that it exhibits a good degree of accuracy for various network configurations and under different operating conditions.

Original language	English
Article number	857705
Pages (from-to)	249-255
Number of pages	7
Journal	Proceedings of the International Conference on Parallel Processing
DOIs	https://doi.org/10.1109/ICPADS.2000.857705
Publication status	Published - 1999
Externally published	Yes
Event	1999 lnternational Workshops on Parallel Processing, ICPP 1999 - Aizu-Wakamatsu, Japan Duration: Sept 24 1999 → …

ASJC Scopus subject areas

Software
Mathematics(all)
Hardware and Architecture

Access to Document

10.1109/ICPADS.2000.857705

Cite this

@article{6a24f41d22054538b2fda1992ce91a3a,

title = "Performance analysis of k-ary n-cubes with fully adaptive routing",

abstract = "Several analytical models of deterministic routing in wormhoie-routed k-ary n-cubes have already been reported in the literature. The performance characteristics of most fully-adaptive routing algorithms have often been analyzed by means of simulation and there is hardly any analytical model proposed for calculating message latency in wormhoie-routed k-ary n-cubes using adaptive routing. This paper proposes an accurate analytical model to predict the message latency in wormhoie-routed k-ary n-cubes with fully-adaptive routing. The proposed model is general in that it exhibits a good degree of accuracy for various network configurations and under different operating conditions.",

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

note = "Publisher Copyright: {\textcopyright} 2000 IEEE; 1999 lnternational Workshops on Parallel Processing, ICPP 1999 ; Conference date: 24-09-1999",

year = "1999",

doi = "10.1109/ICPADS.2000.857705",

language = "English",

pages = "249--255",

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

issn = "0190-3918",

}

TY - JOUR

T1 - Performance analysis of k-ary n-cubes with fully adaptive routing

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 1999

Y1 - 1999

N2 - Several analytical models of deterministic routing in wormhoie-routed k-ary n-cubes have already been reported in the literature. The performance characteristics of most fully-adaptive routing algorithms have often been analyzed by means of simulation and there is hardly any analytical model proposed for calculating message latency in wormhoie-routed k-ary n-cubes using adaptive routing. This paper proposes an accurate analytical model to predict the message latency in wormhoie-routed k-ary n-cubes with fully-adaptive routing. The proposed model is general in that it exhibits a good degree of accuracy for various network configurations and under different operating conditions.

AB - Several analytical models of deterministic routing in wormhoie-routed k-ary n-cubes have already been reported in the literature. The performance characteristics of most fully-adaptive routing algorithms have often been analyzed by means of simulation and there is hardly any analytical model proposed for calculating message latency in wormhoie-routed k-ary n-cubes using adaptive routing. This paper proposes an accurate analytical model to predict the message latency in wormhoie-routed k-ary n-cubes with fully-adaptive routing. The proposed model is general in that it exhibits a good degree of accuracy for various network configurations and under different operating conditions.

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

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

U2 - 10.1109/ICPADS.2000.857705

DO - 10.1109/ICPADS.2000.857705

M3 - Conference article

AN - SCOPUS:84943167604

SN - 0190-3918

SP - 249

EP - 255

JO - Proceedings of the International Conference on Parallel Processing

JF - Proceedings of the International Conference on Parallel Processing

M1 - 857705

T2 - 1999 lnternational Workshops on Parallel Processing, ICPP 1999

Y2 - 24 September 1999

ER -

Performance analysis of k-ary n-cubes with fully adaptive routing

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this