A performance model of compressionless routing in k-ary n-cube networks

Several analytical models of fully adaptive routing in wormhole-routed networks have recently been reported in the literature. All these models, however, have been discussed for routing algorithms with deadlock avoidance. Recent studies have revealed that deadlocks are quite rare in the network, especially when enough routing freedom is provided. Thus, the hardware resources, e,g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated researchers to introduce fully adaptive routing algorithms with deadlock-recovery. This paper proposes a new analytical model to predict message latency in k-aryn-cubes with compressionless routing, a fully adaptive algorithm that uses deadlock-recovery. The proposed model uses results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm to deal with message deadlock. The validity of the model is demonstrated by comparing results predicted by the analytical model against those obtained through simulation experiments.

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

[2]  Erol Gelenbe.  Performance analysis of the connection machine , 1990, SIGMETRICS '90.

[3]  E. Anderson,et al.  Performance of the CRAY T3E Multiprocessor , 1997, ACM/IEEE SC 1997 Conference (SC'97).

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

[5]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

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

[7]  T.M. Pinkston,et al.  On Deadlocks In Interconnection Networks , 1997, Conference Proceedings. The 24th Annual International Symposium on Computer Architecture.

[8]  Krishnan Padmanabhan,et al.  Performance of Multicomputer Networks under Pin-out Constraints , 1991, J. Parallel Distributed Comput..

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

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

[11]  Andrew A. Chien,et al.  Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing , 1997, IEEE Trans. Parallel Distributed Syst..

[12]  Fabrizio Petrini,et al.  Performance analysis of minimal adaptive wormhole routing with time-dependent deadlock recovery , 1997, Proceedings 11th International Parallel Processing Symposium.

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

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

[15]  Ahmad Khonsari,et al.  Compressionless wormhole routing: an analysis for hypercube with virtual channels , 2004, Comput. Electr. Eng..

[16]  Robert E. Stanford,et al.  Reneging Phenomena in Single Channel Queues , 1979, Math. Oper. Res..

[17]  José Duato,et al.  Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent , 1996, Proceedings of International Conference on Parallel Processing.

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

[19]  D. Daley.  General customer impatience in the queue GI/G/ 1 , 1965 .

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

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

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

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

[24]  Xiaola Lin,et al.  The Message Flow Model for Routing in Wormhole-Routed Networks , 1995, IEEE Trans. Parallel Distributed Syst..

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

[26]  Leonard Kleinrock,et al.  A queueing model for wormhole routing with timeout , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

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

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

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

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

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

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

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

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