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

A. Shahrabi, M. Ould-Khaoua

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
EditorsJ. Ma, L.T. Yang
Pages515-519
Number of pages5
Volume2
DOIs
Publication statusPublished - 2005
Event11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 - Fukuoka, Japan
Duration: Jul 20 2005Jul 22 2005

Other

Other11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
CountryJapan
CityFukuoka
Period7/20/057/22/05

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'On the performance of routing algorithms in wormhole-switched multicomputer networks'. Together they form a unique fingerprint.

  • 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 of the International Conference on Parallel and Distributed Systems - ICPADS (Vol. 2, pp. 515-519) https://doi.org/10.1109/ICPADS.2005.209