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 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 2005 11th International Conference on Parallel and Distributed Systems (ICPADS'05)
EditorsJianhua Ma, Laurence T. Yang
PublisherIEEE
Number of pages5
ISBN (Print)0769522815
DOIs
Publication statusPublished - 21 Nov 2005
Event11th International Conference on Parallel and Distributed Systems Workshops - Fukuoka Institute of Technology (FIT), Fukuoka, Japan
Duration: 20 Jul 200522 Jul 2005

Publication series

Name
Volume2
ISSN (Print)1521-9097

Conference

Conference11th International Conference on Parallel and Distributed Systems Workshops
Abbreviated titleICPADS 2005
Country/TerritoryJapan
CityFukuoka
Period20/07/0522/07/05

ASJC Scopus subject areas

  • Hardware and Architecture

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