This paper presents an analytical evaluation of the performance of adaptive wormhole routing in a two-dimensional torus. Our analysis focuses on minimal and fully adaptive wormhole routing that allows a message to use any shortest path between source and destination. A validation of the analysis through simulation is presented to demonstrate the accuracy of the obtained results. Finally, we remark that no theoretical limitation prevents the extension of our analytical approach to the evaluation of the performance of adaptive wormhole routing in hypercubes or other symmetric topologies with wrap-around connections. (C) 2002 Elsevier Science B.V. All rights reserved
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of vir...
The star graph was introduced as an attractive alternative to the well-known hypercube and its prope...
As software overheads decrease and processor speeds increase relative to network speeds, the perfor...
This paper presents an analytical evaluation of the performance of adaptive wormhole routing in a tw...
This paper presents an analytical evaluation of the performance of wormhole switching with adaptive ...
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
a new analytical approach for the performance evaluation of asynchronous wormhole routing in k-ary n...
Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes an...
Although several analytical models have been proposed in the literature for different interconnectio...
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
Several models of deterministic routing have been proposed for wormhole-routed mesh networks while t...
This paper presents a comparative performance study of adaptive and deterministic routing algorithms...
We present a new analytical approach for the performance evaluation of deterministic wormhole routin...
An algorithm that extends the Minimum-hop routing algorithm as presented in Garcia-Luna-Aceves 1989 ...
Wormhole routing and deflection routing are two of the most promising techniques used for routing me...
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of vir...
The star graph was introduced as an attractive alternative to the well-known hypercube and its prope...
As software overheads decrease and processor speeds increase relative to network speeds, the perfor...
This paper presents an analytical evaluation of the performance of adaptive wormhole routing in a tw...
This paper presents an analytical evaluation of the performance of wormhole switching with adaptive ...
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
a new analytical approach for the performance evaluation of asynchronous wormhole routing in k-ary n...
Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes an...
Although several analytical models have been proposed in the literature for different interconnectio...
2D-mesh and torus networks have often been proposed as the interconnection pattern for parallel comp...
Several models of deterministic routing have been proposed for wormhole-routed mesh networks while t...
This paper presents a comparative performance study of adaptive and deterministic routing algorithms...
We present a new analytical approach for the performance evaluation of deterministic wormhole routin...
An algorithm that extends the Minimum-hop routing algorithm as presented in Garcia-Luna-Aceves 1989 ...
Wormhole routing and deflection routing are two of the most promising techniques used for routing me...
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of vir...
The star graph was introduced as an attractive alternative to the well-known hypercube and its prope...
As software overheads decrease and processor speeds increase relative to network speeds, the perfor...