On the Performance of Routing Algorithms in Wormhole-Switched Multicomputer Networks

Authors:
A. Shahrabi;M. Ould-Khaoua
Affiliations:
School of Computing and Mathematical Sciences, Glasgow Caledonian University Glasgow G4 0BA, U.K.;Department of Computing Science University of Glasgow, Glasgow G12 8RZ U.K.
Venue:
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Year:
2005

Citing 0
Cited 1

A new modelling approach of wormhole-switched networks with finite buffers

International Journal of Parallel, Emergent and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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.