Simulation Study of Interconnection Networks with Virtual Cut-Through Routing

A simple network model with torus topology and the virtual cut-through routing has been considered in order to find out and analyze certain relationships between network parameters, load and performance. 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. If the network is in the steady state, a good agreement with Little’s theorem has been observed.

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

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

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

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

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

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

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

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

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

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

[11]  Jordi Cortadella,et al.  A performance analytical model for Network-on-Chip with constant service time routers , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

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

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

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

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

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