A performance model of pipelined circuit switching in hypercubes

Abstract Analytical models for wormhole routing in multicomputer networks have been widely reported in the literature. Although several recent studies have revealed that pipelined circuit switching (PCS) can provide superior performance characteristics over wormhole routing, there has been hardly any study that describes performance models for PCS. As a result, all existing studies have resorted to simulation when evaluating the performance merits of PCS. In an effort to fill this gap, this paper proposes the first analytical model for PCS in hypercube networks. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

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

[2]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

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

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

[5]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

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

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

[8]  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.

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

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

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

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

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

[14]  Wayne H. Wolf,et al.  An Automaton Model for Scheduling Constraints in Synchronous Machines , 1995, IEEE Trans. Computers.

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

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

[17]  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..

[18]  D. Lenoski,et al.  The SGI Origin: A ccnuma Highly Scalable Server , 1997, Conference Proceedings. The 24th Annual International Symposium on Computer Architecture.

[19]  Pedro López,et al.  A high performance router architecture for interconnection networks , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[20]  Mohamed Ould-Khaoua,et al.  Modelling fully‐adaptive routing in hypercubes , 2000, Telecommun. Syst..

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

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

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