Message latency in the 2-dimensional mesh with wormhole routing

Abstract Analytical models of deterministic routing in hypercubes and tori with wormhole routing have been widely reported in the literature. Greenberg and Guan (in R. Greenberg, L. Guan, Modelling and comparison of wormhole routed mesh and torus networks, Proc. 9th IASTED Int. Conf. Parallel and Distributed Computing and Systems, October 1997) have recently described a model of deterministic routing in the 2-dimensional mesh, which has been one of the most popular multicomputer networks. Although there have been many adaptive routing algorithms proposed for this network, there has been hardly any study that proposes an analytical model for these algorithms. This paper proposes an approximate analytical model to compute message latency in the mesh with fully-adaptive routing. Results from simulation experiments are then presented to validate the model.

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

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

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

[4]  Rainer Hoch,et al.  From paper to office document standard representation , 1992, Computer.

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

[6]  William J. Dally.  Virtual-channel flow control , 1990, ISCA '90.

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

[8]  Charles L. Seitz,et al.  Multicomputers: message-passing concurrent computers , 1988, Computer.

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

[10]  Andrew A. Chien,et al.  A Cost and Speed Model for k-ary n-Cube Wormhole Routers , 1998, IEEE Trans. Parallel Distributed Syst..

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

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

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

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

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

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

[17]  Anoop Gupta,et al.  The Stanford Dash multiprocessor , 1992, Computer.

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

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

[20]  Alain J. Martin,et al.  The architecture and programming of the Ametek series 2010 multicomputer , 1988, C3P.

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