An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks

Abstract Many fully adaptive algorithms have been proposed in the literature over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes an analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. The analysis focuses Duato’s fully adaptive routing algorithm [IEEE Trans. Parall. Distrib. Syst. 4 (2) (1993) 320], which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general in that it exhibits a good degree of accuracy for various network sizes and under different operating conditions.

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

[2]  Mohamed Ould-Khaoua,et al.  Analysis of fully adaptive wormhole routing in tori , 1999, Parallel Comput..

[3]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

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

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

[6]  W.-J. Guan,et al.  An analytical model for wormhole routing in multicomputer interconnection networks , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

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

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

[9]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

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

[11]  Randolph D. Nelson,et al.  Probability, stochastic processes, and queueing theory - the mathematics of computer performance modeling , 1995 .

[12]  William J. Dally,et al.  The Reliable Router: A Reliable and High-Performance Communication Substrate for Parallel Computers , 1994, PCRCW.

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

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

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

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

[17]  José Duato,et al.  On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies , 1991, PARLE.

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

[19]  James Sutton,et al.  iWarp: a 100-MOPS, LIW microprocessor for multicomputers , 1991, IEEE Micro.

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

[21]  Kang G. Shin,et al.  Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[22]  Xiaola Lin,et al.  The Message Flow Model for Routing in Wormhole-Routed Networks , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

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

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

[25]  Bruno Ciciani,et al.  Performance Analysis of Wormhole Switching with Adaptive Routing in a Two-Dimensional Torus , 1999, Euro-Par.

[26]  Randolph Nelson,et al.  Probability, Stochastic Processes, and Queueing Theory , 1995 .

[27]  Erol Gelenbe,et al.  Multiprocessor Performance , 1990, SIGMETRICS Perform. Evaluation Rev..

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

[29]  Michael D. Noakes,et al.  System design of the J-Machine , 1990 .

[30]  Derek L. Eager,et al.  Routing in wormhole networks , 1996 .