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

Shahrabi, A. and Ould-Khaoua, M. (2005) On the performance of routing algorithms in wormhole-switched multicomputer networks. In: Proceedings of the 11th International Conference on Parallel and Distributed Systems 2005 (ICPADS '05), Fukuoka, Japan, 20-22 July 2005, pp. 515-519. (doi: 10.1109/ICPADS.2005.209)

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.

• Item Type: Conference Proceedings
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Ould-Khaoua, Dr Mohamed
• Authors: Shahrabi, A., and Ould-Khaoua, M.
• Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
• College/School: College of Science and Engineering > School of Computing Science
• Publisher: IEEE Computer Society
• ISSN: 1521-9097
• Copyright Holders: Copyright © 2005 IEEE
• First Published: First published in Proceedings of the 11th International conference on Parallel and Distributed Systems 2005 (ICPADS '05)
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher.