Virtual Cut-Through Routing in Multidimensional Interconnection Networks

This paper considers a model of an n-dimensional toroidal rectangular interconnection network with the virtual cut-through routing. The network performance as a function of network parameters and the message load is analyzed. An exact analytical expression for the saturation point and the latency as a function of message generation rate under the mean field theory approximation have been obtained. The saturation point has been found proportional to the number of the torus dimensions and inversely proportional to the message length and to the length of the path from the source to the destination. The transition to saturation state is a second-order(continuous) phase transition with a critical exponent equal to 1.

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

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

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

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

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

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

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

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

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

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

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

[13]  DabrowskiChristopher.  Catastrophic event phenomena in communication networks , 2015 .

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

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

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

[17]  Bernd Hamann,et al.  Visualizing the Five-dimensional Torus Network of the IBM Blue Gene/Q , 2014, 2014 First Workshop on Visual Performance Analysis.

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

[19]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[20]  Dinesh Lekariya.  Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus Topology NOC Architecture under CBR Traffic , 2013 .

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

[22]  Mamta P. Daf,et al.  Performance and Evaluation of Loopback Virtual Channel Router with Heterogeneous Router for On-Chip Network , 2014, 2014 Fourth International Conference on Communication Systems and Network Technologies.

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

[24]  Christopher D. Carothers,et al.  Modeling Billion-Node Torus Networks Using Massively Parallel Discrete-Event Simulation , 2011, 2011 IEEE Workshop on Principles of Advanced and Distributed Simulation.

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

[26]  Terrence Mak,et al.  Extending the performance of hybrid NoCs beyond the limitations of network heterogeneity , 2017 .

[27]  Mark G. Karpovsky,et al.  A New Method for Deadlock Elimination in Computer Networks With Irregular Toplologies , 1999 .

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

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

[30]  Lev B. Levitin,et al.  Performance model of a multiprocessor interconnection network: theory and simulation , 2007, SpringSim '07.

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

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

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