Analysis of circuit switching for the torus interconnect networks with hot-spot traffic

Several analytical models have recently been proposed for circuit-switched interconnect networks under the uniform traffic pattern. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns, such as hot-spots. This paper presents a new mathematical model to capture the mean message latency in the torus interconnect network with circuit switching in the presence of hot-spot. Simulation experiments demonstrate close agreement between the observed network behavior and those obtained by the analytical model

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

[2]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[3]  J DallyWilliam,et al.  Performance Analysis of k-ary n-cube Interconnection Networks , 1990 .

[4]  Bruno Ciciani,et al.  Performance Analysis of Circuit-Switching Interconnection Networks with Deterministic and Adaptive Routing , 1998, Perform. Evaluation.

[5]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[6]  H. Sarbazi-Azad,et al.  Communication delay in circuit-switched interconnection networks , 2001, Conference Proceedings of the 2001 IEEE International Performance, Computing, and Communications Conference (Cat. No.01CH37210).

[7]  Pablo Molinero-Fernández,et al.  The performance of circuit switching in the internet , 2002, CCRV.

[8]  Emmanouel A. Varvarigos,et al.  Circuit Switching with Input Queuing: An Analysis for the d-Dimensional Wraparound Mesh and the Hypercube , 1997, IEEE Trans. Parallel Distributed Syst..

[9]  Mohamed Ould-Khaoua,et al.  A Performance Model for Duato's Fully Adaptive Routing Algorithm in k-Ary n-Cubes , 1999, IEEE Trans. Computers.

[10]  William J. Dally,et al.  Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[11]  Prasant Mohapatra,et al.  Wormhole routing techniques for directly connected multicomputer systems , 1998, CSUR.

[12]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[13]  H. Sarbazi-Azad,et al.  Hot spot analysis in wormhole-routed tori , 2000, Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086).

[14]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[15]  R. E. Kessler,et al.  Cray T3D: a new dimension for Cray Research , 1993, Digest of Papers. Compcon Spring.

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

[17]  Imrich Chlamtac,et al.  A Performance Model of a Connection-Oriented Hypercube Interconnection System , 1996, Perform. Evaluation.

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

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