Many research studies have proposed analytical models to evaluate the performance of k-ary n-cubes with deterministic wormhole routing. Such models however have so far been confined to uniform traffic distributions. There has been hardly any model proposed that deal with non-uniform traffic distributions that could arise due to, for instance, the presence of hot-spots in the network. This paper proposes the first analytical model to predict message latency in k-ary n-cubes with deterministic routing in the presence of hot-spots. The validity of the model is demonstrated by comparing analytical results with those obtained through extensive simulation experiments
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
The performance of k-ary n-cube interconnection networks is analyzed under the assumption of constan...
Many research studies have proposed analytical models to evaluate the performance of k-ary n-cubes w...
Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes an...
We present a new analytical approach for the performance evaluation of deterministic wormhole routin...
Perhaps the most critical component in determining the ultimate performance potential of a multicomp...
We present a new analytical approach for the performance evaluation of asynchronous wormhole routing...
An efficient interconnection network that provides high bandwidth and low latency interprocessor com...
K-ary n-cubes have been one of the most popular interconnection networks for practical multicomputer...
An algorithm that extends the Minimum-hop routing algorithm as presented in Garcia-Luna-Aceves 1989 ...
K-ary n-cubes have been one of the most popular interconnection networks for practical multicomputer...
This paper presents a comparative performance study of adaptive and deterministic routing algorithms...
The star graph was introduced as an attractive alternative to the well-known hypercube and its prope...
This paper identifies performance degradation in wormhole routed k-ary n-cube networks due to limite...
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
The performance of k-ary n-cube interconnection networks is analyzed under the assumption of constan...
Many research studies have proposed analytical models to evaluate the performance of k-ary n-cubes w...
Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes an...
We present a new analytical approach for the performance evaluation of deterministic wormhole routin...
Perhaps the most critical component in determining the ultimate performance potential of a multicomp...
We present a new analytical approach for the performance evaluation of asynchronous wormhole routing...
An efficient interconnection network that provides high bandwidth and low latency interprocessor com...
K-ary n-cubes have been one of the most popular interconnection networks for practical multicomputer...
An algorithm that extends the Minimum-hop routing algorithm as presented in Garcia-Luna-Aceves 1989 ...
K-ary n-cubes have been one of the most popular interconnection networks for practical multicomputer...
This paper presents a comparative performance study of adaptive and deterministic routing algorithms...
The star graph was introduced as an attractive alternative to the well-known hypercube and its prope...
This paper identifies performance degradation in wormhole routed k-ary n-cube networks due to limite...
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
The performance of k-ary n-cube interconnection networks is analyzed under the assumption of constan...