Virtual cut-through routing in toroidal interconnection networks

A simple network model with torus topology and the virtual cut-through routing have been considered in order to find out and analyze certain relationships that can be used as a starting point for a deeper theoretical analysis and further research. An expression for the saturation point (message generation rate at which network saturates) and approximate expressions for the latency as a function of the message generation rate have been obtained. Simulation experiments for various values of network parameters (mesh size, message path length, and message length) have been performed. It is found that if the mesh linear dimension is at least twice as large as the message path length (the distance from source to destination) the network behavior (latency and saturation point) does not depend on the mesh size. Both theoretical and empirical results show that the saturation point is inversely proportional to the message length.

[1]  Wei Li,et al.  Cascading Failures in Interdependent Lattice Networks: The Critical Role of the Length of Dependency Links , 2012, Physical review letters.

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

[3]  Sheng Ma,et al.  A comprehensive comparison between virtual cut-through and wormhole routers for cache coherent Network on-Chips , 2014, IEICE Electron. Express.

[4]  Yelena Rykalova Phase Transitions in Interconnection Networks with Finite Buffers , 2016 .

[5]  James R. Jackson,et al.  Jobshop-Like Queueing Systems , 2004, Manag. Sci..

[6]  Yogita A. Sadawarte,et al.  Implementation of Virtual Cut-Through Algorithm For Network on Chip Architecture , 2011 .

[7]  Mark G. Karpovsky,et al.  Deadlock Prevention with Wormhole Routing: Irregular Topology , 2013 .

[8]  Philip Heidelberger,et al.  The IBM Blue Gene/Q interconnection network and message unit , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

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

[10]  ResearchFlorham Park,et al.  Analytical Modeling of Routing Algorithms in Virtual Cut-Through Networks , 2008 .

[11]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

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

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

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

[15]  L. Levitin Latency and Phase Transitions in Interconnection Networks with Unlimited Buffers , 2016 .

[16]  Mark G. Karpovsky,et al.  A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph , 2006, J. Graph Algorithms Appl..