On the performance of routing algorithms in wormhole-switched multicomputer networks

A. Shahrabi; M. Ould-Khaoua

doi:10.1109/ICPADS.2005.209

On the performance of routing algorithms in wormhole-switched multicomputer networks

A. Shahrabi^*, M. Ould-Khaoua

^*Corresponding author for this work

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

3 Citations (Scopus)

Abstract

This paper presents a comparative performance study of adaptive and deterministic routing algorithms in wormhole-switched hypercubes and investigates the performance vicissitudes of these routing schemes under a variety of network operating conditions. Despite the previously reported results, our results show that the adaptive routing does not consistently outperform the deterministic routing even for high dimensional networks. In fact, it appears that the superiority of adaptive routing is highly dependent to the broadcast traffic rate generated at each node and it begins to deteriorate by growing the broadcast rate of generated message.

Original language	English
Title of host publication	Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
Editors	J. Ma, L.T. Yang
Pages	515-519
Number of pages	5
DOIs	https://doi.org/10.1109/ICPADS.2005.209
Publication status	Published - 2005
Externally published	Yes
Event	11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 - Fukuoka, Japan Duration: Jul 20 2005 → Jul 22 2005

Publication series

Name	Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
Volume	2
ISSN (Print)	1521-9097

Other

Other	11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
Country/Territory	Japan
City	Fukuoka
Period	7/20/05 → 7/22/05

ASJC Scopus subject areas

Hardware and Architecture

Access to Document

10.1109/ICPADS.2005.209

Cite this

Shahrabi, A., & Ould-Khaoua, M. (2005). On the performance of routing algorithms in wormhole-switched multicomputer networks. In J. Ma, & L. T. Yang (Eds.), Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 (pp. 515-519). (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS; Vol. 2). https://doi.org/10.1109/ICPADS.2005.209

On the performance of routing algorithms in wormhole-switched multicomputer networks. / Shahrabi, A.; Ould-Khaoua, M.
Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. ed. / J. Ma; L.T. Yang. 2005. p. 515-519 (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS; Vol. 2).

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

Shahrabi, A & Ould-Khaoua, M 2005, On the performance of routing algorithms in wormhole-switched multicomputer networks. in J Ma & LT Yang (eds), Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, vol. 2, pp. 515-519, 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005, Fukuoka, Japan, 7/20/05. https://doi.org/10.1109/ICPADS.2005.209

Shahrabi A, Ould-Khaoua M. On the performance of routing algorithms in wormhole-switched multicomputer networks. In Ma J, Yang LT, editors, Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. 2005. p. 515-519. (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS). doi: 10.1109/ICPADS.2005.209

@inproceedings{bcf0abaa35b640c6ae3efd2efe08e553,

title = "On the performance of routing algorithms in wormhole-switched multicomputer networks",

abstract = "This paper presents a comparative performance study of adaptive and deterministic routing algorithms in wormhole-switched hypercubes and investigates the performance vicissitudes of these routing schemes under a variety of network operating conditions. Despite the previously reported results, our results show that the adaptive routing does not consistently outperform the deterministic routing even for high dimensional networks. In fact, it appears that the superiority of adaptive routing is highly dependent to the broadcast traffic rate generated at each node and it begins to deteriorate by growing the broadcast rate of generated message.",

author = "A. Shahrabi and M. Ould-Khaoua",

year = "2005",

doi = "10.1109/ICPADS.2005.209",

language = "English",

isbn = "0769522815",

series = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",

pages = "515--519",

editor = "J. Ma and L.T. Yang",

booktitle = "Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005",

note = "11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 ; Conference date: 20-07-2005 Through 22-07-2005",

}

TY - GEN

T1 - On the performance of routing algorithms in wormhole-switched multicomputer networks

AU - Shahrabi, A.

AU - Ould-Khaoua, M.

PY - 2005

Y1 - 2005

N2 - This paper presents a comparative performance study of adaptive and deterministic routing algorithms in wormhole-switched hypercubes and investigates the performance vicissitudes of these routing schemes under a variety of network operating conditions. Despite the previously reported results, our results show that the adaptive routing does not consistently outperform the deterministic routing even for high dimensional networks. In fact, it appears that the superiority of adaptive routing is highly dependent to the broadcast traffic rate generated at each node and it begins to deteriorate by growing the broadcast rate of generated message.

AB - This paper presents a comparative performance study of adaptive and deterministic routing algorithms in wormhole-switched hypercubes and investigates the performance vicissitudes of these routing schemes under a variety of network operating conditions. Despite the previously reported results, our results show that the adaptive routing does not consistently outperform the deterministic routing even for high dimensional networks. In fact, it appears that the superiority of adaptive routing is highly dependent to the broadcast traffic rate generated at each node and it begins to deteriorate by growing the broadcast rate of generated message.

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

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

U2 - 10.1109/ICPADS.2005.209

DO - 10.1109/ICPADS.2005.209

M3 - Conference contribution

AN - SCOPUS:23944518962

SN - 0769522815

T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

SP - 515

EP - 519

BT - Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005

A2 - Ma, J.

A2 - Yang, L.T.

T2 - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005

Y2 - 20 July 2005 through 22 July 2005

ER -

On the performance of routing algorithms in wormhole-switched multicomputer networks

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this