Performance comparison of routing algorithms in wormhole-switched networks

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.

[1]  E. Anderson,et al.  Performance of the CRAY T3E Multiprocessor , 1997, ACM/IEEE SC 1997 Conference (SC'97).

[2]  Hamid Sarbazi-Azad,et al.  Towards a more realistic comparative analysis of multicomputer networks , 2004, Concurr. Pract. Exp..

[3]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

[4]  A. A. Chein,et al.  A cost and speed model for k-ary n-cube wormhole routers , 1998 .

[5]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[6]  Mohamed Ould-Khaoua,et al.  Latency of double-tree broadcast in wormhole-routed hypercubes , 2001, International Conference on Parallel Processing, 2001..

[7]  Dhabaleswar K. Panda,et al.  Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths , 1999, IEEE Trans. Parallel Distributed Syst..

[8]  Joydeep Ghosh,et al.  A Comprehensive Analytical Model for Wormhole Routng in Multicomputer Systems , 1994, J. Parallel Distributed Comput..

[9]  Walid A. Najjar,et al.  Preliminary Evaluation of a Hybrid Deterministic/Adaptive Router , 1997, PCRCW.

[10]  Hong Xu,et al.  Unicast-Based Multicast Communication in Wormhole-Routed Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[11]  Bruno Ciciani,et al.  Performance evaluation of deterministic wormhole routing in k-ary n-cubes , 1998, Parallel Comput..

[12]  Mohamed Ould-Khaoua,et al.  An analytical model of wormhole-routed hypercubes under broadcast traffic , 2003, Perform. Evaluation.

[13]  Krishnan Padmanabhan,et al.  Performance of the Direct Binary n-Cube Network for Multiprocessors , 1989, IEEE Trans. Computers.

[14]  Ronald I. Greenberg,et al.  Modeling and Comparison of Wormhole Routed Mesh and Torus Networks , 1997 .

[15]  José Duato.  A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[16]  Andrew A. Chien,et al.  The Cost of Adaptivity and Virtual Lanes in aWormhole Router , 1995 .

[17]  Mohamed Ould-Khaoua,et al.  Performance modelling of broadcast communication in multicomputer networks , 2005, Parallel Algorithms Appl..

[18]  Krishnan Padmanabhan,et al.  Performance of Multicomputer Networks under Pin-out Constraints , 1991, J. Parallel Distributed Comput..

[19]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

[20]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[21]  Hamid Sarbazi-Azad,et al.  Towards a more realistic comparative analysis of multicomputer networks: Research Articles , 2004 .

[22]  H. Sarbazi-Azad,et al.  Analytical modelling of wormhole-routed k-ary n-cubes in the presence of matrix-transpose traffic , 2003, J. Parallel Distributed Comput..

[23]  Philip K. McKinley,et al.  Efficient Broadcast in All-Port Wormhole-Routed Hypercubes , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[24]  Suresh Chalasani,et al.  A comparison of adaptive wormhole routing algorithms , 1993, ISCA '93.

[25]  Hamid Sarbazi-Azad,et al.  A Performance Model of Adaptive Wormhole Routing in k-Ary n-Cubes in the Presence of Digit-Reversal Traffic , 2004, The Journal of Supercomputing.

[26]  Mohamed Ould-Khaoua,et al.  Modelling of Adaptive Wormhole-Routed Hypercubes in the Presence of Broadcast Traffic , 2002 .

[27]  Walid A. Najjar,et al.  Empirical evaluation of deterministic and adaptive routing with constant-area routers , 1997, Proceedings 1997 International Conference on Parallel Architectures and Compilation Techniques.

[28]  Philip K. McKinley,et al.  Collective Communication in Wormhole-Routed Massively Parallel Computers , 1995, Computer.