Performance comparison of routing algorithms in wormhole-switched networks

Abstract

This paper presents, building on the analytical models developed in [A. Shahrabi, M. Ould-Khoua, L. Mackenzie, Performance modelling of broadcast communication in multicomputer networks, International Journal of Parallel, Emergent, and Distributed Systems 20 (1) (2005); A. Shahrabi, M. Ould-Khoua, On the communication latency of wormhole routed interconnection networks, International Journal of Simulation 4 (5–6) (2003) 32–43; A. Shahrabi, L. Mackenzie, M. Ould-Khoua, Modelling of Adaptive Wormhole-Routed Hypercubes in the Presence of Broadcast Traffic, in: N.J. Dimopoulos, K.F. Li (Eds.), Chapter 10 in High Performance Computing Systems And Applications, Kluwer Academic Publishers, Boston, 2002; A. Shahrabi, M. Ould-Khoua, L. Mackenzie, An Analytical Model of Wormhole-Routed Hypercubes under Broadcast Traffic, Performance Evaluation 53 (1) (2003) 23–42; A. Shahrabi, M. Ould-Khoua, L. Mackenzie, Latency of double-tree broadcast in wormhole-routed hypercubes, in: Proceedings of International Conference on Parallel Processing (ICPP’01), IEEE Computer Society, 2001, pp. 401–408] a comparative performance study of adaptive and deterministic routing algorithms in wormhole-switched interconnection networks carrying a broadcast traffic component and investigates the performance vicissitudes of them under a variety of network operating conditions. In contrast to previous works, which have reported superiority of adaptive over deterministic routing especially in high-dimensional networks such as hypercubes, our results show that adaptivity does not necessarily improve network performance even for high-dimensional networks and its superiority starts to deteriorate as the broadcast fraction of generated traffic increases.