Computer interconnection networks with virtual cut-through routing

Abstract This paper considers a model of a toroidal computer interconnection network with the virtual cut-through routing. The interrelationships between network parameters, load and performance are analyzed. An exact analytical expression for the saturation point and expressions for the latency as a function of the message generation rate under the mean field theory approximation have been obtained. The theoretical results have been corroborated with the results of simulation experiments for various values of network parameters. The network behavior has been found not depending on the torus linear dimensions provided that they are at least twice as large as the message path length. The saturation point has been found to be inversely proportional to the message length in good agreement with the analytical results. A good agreement with Little’s theorem has been found if the network remains in the steady state during the experiment.

[1]  Axel Jantsch,et al.  An Analytical Latency Model for Networks-on-Chip , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[2]  Antonio Robles,et al.  A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOW Environment , 2001, J. Parallel Distributed Comput..

[3]  journals Iosr,et al.  An Analytical Router Model for Networks-On-Chip , 2015 .

[4]  Lev B. Levitin,et al.  Analysis and Simulation of Computer Networks with Unlimited Buffers , 2014 .

[5]  D. S. Chaudhari,et al.  Implementation of Five Port Router Architecture Using VHDL , 2012 .

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

[7]  Sudhanshu Choudhary,et al.  Performance evaluation of mesh-based NoCs: Implementation of a new architecture and routing algorithm , 2012, International Journal of Automation and Computing.

[8]  Yasushi Inoguchi,et al.  Uniform Traffic Patterns using Virtual Cut-Through Flow Control on VMMN☆ , 2015 .

[9]  Mark G. Karpovsky,et al.  Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[10]  Lev B. Levitin,et al.  Critical phenomena in discrete-time interconnection networks , 2010 .

[11]  Mark G. Karpovsky,et al.  Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies , 2014, IEEE Transactions on Control of Network Systems.