Adaptive routing in wormhole-switched necklace-cubes: Analytical modelling and performance comparison

Abstract The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topological properties, VLSI and algorithmic aspects of this network. Several analytical models have been proposed in the literature for different interconnection networks, as the most cost-effective tools to evaluate the performance merits of such systems. This paper proposes an analytical performance model to predict message latency in wormhole-switched necklace hypercube interconnection networks with fully adaptive routing. The analysis focuses on a fully adaptive routing algorithm which has been shown to be the most effective for necklace hypercube networks. The results obtained from simulation experiments confirm that the proposed model exhibits a good accuracy under different operating conditions.

[1]  Hamid Sarbazi-Azad,et al.  An accurate performance model of fully adaptive routing in wormhole-switched two-dimensional mesh multicomputers , 2007, Microprocess. Microsystems.

[2]  Bruno Ciciani,et al.  An accurate model for the performance analysis of deterministic wormhole routing , 1997, Proceedings 11th International Parallel Processing Symposium.

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

[4]  Anant Agarwal,et al.  Limits on Interconnection Network Performance , 1991, IEEE Trans. Parallel Distributed Syst..

[5]  Hamid Sarbazi-Azad,et al.  Topological properties of necklace networks , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).

[6]  Hamid Sarbazi-Azad,et al.  Performance Modelling of Necklace Hypercubes , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[7]  Hamid Sarbazi-Azad,et al.  Empirical Performance Evaluation of Adaptive Routing in Necklace Hypercubes: A Comparative Study , 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).

[8]  Hamid Sarbazi-Azad,et al.  Simulation-Based Performance Evaluation of Deterministic Routing in Necklace Hypercubes , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.

[9]  Hamid Sarbazi-Azad,et al.  The Stretched Network: Properties, Routing, and Performance , 2008, J. Inf. Sci. Eng..

[10]  Hamid Sarbazi-Azad,et al.  Constraint-based performance comparison of multi-dimensional interconnection networks with deterministic and adaptive routing strategies , 2004, Comput. Electr. Eng..

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

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

[13]  Chita R. Das,et al.  Hypercube Communication Delay with Wormhole Routing , 1994, IEEE Trans. Computers.

[14]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[15]  William J. Dally.  Virtual-channel flow control , 1990, ISCA '90.

[16]  Hamid Sarbazi-Azad,et al.  An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks , 2001, Perform. Evaluation.

[17]  Alpesh Patel,et al.  Area-Efficient VLSI Layouts for Binary Hypercubes , 2000, IEEE Trans. Computers.

[18]  Hamid Sarbazi-Azad,et al.  XMulator: A Listener-Based Integrated Simulation Platform for Interconnection Networks , 2007, First Asia International Conference on Modelling & Simulation (AMS'07).