Computer interconnection networks with virtual cut-through routing

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.Accepted manuscrip

An analytical model for virtual cut-through routing

An analytical model of a network with 2-dim torus topology and virtual cut-through routing has been considered in order to find out and analyze certain relationships between network parameters, load and performance. An exact expression for the saturation point (message generation rate at which network saturates) and expressions for the latency as a function of the message generation rate under the assumptions of the “mean field” theory have been obtained. It has been found that the saturation point is inversely proportional to the message length and to the distance between the source and destination. The theoretical results are in a good agreement with small-scale simulation experiments.Accepted manuscrip

Analysis and simulation of 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. 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. If the network is in the steady state, a good agreement with Little’s theorem has been observed.Accepted manuscrip