Performance modelling of pipelined circuit switching in hypercubes with hot spot traffic

Pipelined Circuit Switching (PCS) has been suggested as an efficient switching method for supporting interprocessor communication in multicomputer networks due to its ability to preserve both communication performance and fault-tolerant demands in these networks. A number of studies have demonstrated that PCS can exhibit superior performance characteristics over Wormhole Switching (WS) under uniform traffic. However, the performance properties of PCS have not yet been thoroughly investigated in the presence of non-uniform traffic. Analytical model of PCS for common networks (e.g., hypercube) under the uniform traffic pattern has been reported in the literature. A non-uniform traffic model that has attracted much attention is the hot spot model which leads to extreme network congestion resulting in serious performance degradation due to the tree saturation phenomenon in the network. An analytical model for WS with hot spot traffic has been reported in the literature. However, to the best of our knowledge, there has not been reported any analytical model for PCS augmented with virtual channels in the presence of hot spot traffic. This paper proposes a model for this switching mechanism using new methods to calculate the probability of message header blocking and hot spot rates on channels. The model makes latency predictions that are in good agreement with those obtained through simulation experiments. An extensive performance comparison using the new analytical model reveals that PCS performs the same or in some occasions worse than WS in the presence of hot spot traffic.

[1]  Ranga Vemuri,et al.  An integrated multicomponent synthesis environment for MCMs , 1993, Computer.

[2]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[3]  J. Little A Proof for the Queuing Formula: L = λW , 1961 .

[4]  Hamid Sarbazi-Azad,et al.  An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hot Spot Traffic , 2001, IEEE Trans. Parallel Distributed Syst..

[5]  Sudhakar Yalamanchili,et al.  Ariadne—an adaptive router for fault-tolerant multicomputers , 1994, ISCA '94.

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

[7]  Sudhakar Yalamanchili,et al.  A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[8]  J D Littler,et al.  A PROOF OF THE QUEUING FORMULA , 1961 .

[9]  S. F. Nugent,et al.  The iPSC/2 direct-connect communications technology , 1988, C3P.

[10]  William J. Dally Virtual-Channel Flow Control , 1992, IEEE Trans. Parallel Distributed Syst..

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

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

[13]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[14]  Sudhakar Yalamanchili,et al.  MMR: a high-performance MultiMedia Router-architecture and design trade-offs , 1999, Proceedings Fifth International Symposium on High-Performance Computer Architecture.

[15]  Hamid Sarbazi-Azad,et al.  Modelling of pipelined circuit switching in multicomputer networks , 2000, Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728).

[16]  Mahmood Fathy,et al.  An analytical model of pipelined circuit switching in hypercubes in the presence of hot spot traffic , 2005, 2005 International Conference on Parallel Processing Workshops (ICPPW'05).

[17]  Edward F. Miller Bibliography on Techniques of Computer Performance Analysis , 1972, Computer.

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

[19]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

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

[21]  Mohamed Ould-Khaoua,et al.  A Comparative Study of Switching Methods in Multicomputer Networks , 2004, The Journal of Supercomputing.

[22]  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).

[23]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[24]  Frederic T. Chong,et al.  METRO: a router architecture for high-performance, short-haul routing networks , 1994, ISCA '94.

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