An accurate model for the performance analysis of deterministic wormhole routing

Presents a new analytical approach for the performance evaluation of asynchronous wormhole routing in k-ary n-cubes. Through the analysis of network flows, our methodology furnishes a closed formula for the average message delay in wormhole deterministic routing. In this paper, the focus is on 3D asymmetric torus networks with uni-directional or bi-directional links. However, the model can be easily applied to evaluate the performance of deterministic wormhole policies in any hypercube and torus topology. The comparison with two simulation models demonstrates that our methodology gives accurate results for both low and high traffics.

[1]  Lionel M. Ni,et al.  Routing Techniques in Direct Networks , 1993 .

[2]  Derek L. Eager,et al.  The interaction between virtual channel flow control and adaptive routing in wormhole networks , 1994, ICS '94.

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

[4]  D. A. Reed,et al.  Networks for parallel processors: measurements and prognostications , 1988, C3P.

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

[6]  Luis Gravano,et al.  Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks , 1992, SPAA '92.

[7]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[8]  Suresh Chalasani,et al.  A comparison of adaptive wormhole routing algorithms , 1993, ISCA '93.

[9]  Bruno Ciciani,et al.  Communication Switching Techniques and Link-Conflict Resolution Strategies: A Comparison Analysis , 1995, EUROSIM.

[10]  Mary K. Vernon,et al.  Performance Analysis of Mesh Interconnection Networks with Deterministic Routing , 1994, IEEE Trans. Parallel Distributed Syst..

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

[12]  Andrew A. Chien,et al.  Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.

[13]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[14]  Luis Gravano,et al.  Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks , 1994, IEEE Trans. Parallel Distributed Syst..