A novel deadlock free and starvation free packet switching communication processor
Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
High performance communications in processor networks
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
A deadlock free routing algorithm with network size independent buffering space
CONPAR 90 Proceedings of the joint international conference on Vector and parallel processing
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Minimum deadlock-free message routing restrictions in binary hypercubes
Journal of Parallel and Distributed Computing
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks
IEEE Transactions on Computers
Parallel stereocorrelation on a reconfigurable multi-ring network
The Journal of Supercomputing - Special issue on parallel and distributed processing
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Routing with Compact Routing Tables: Interval Labelling Scheme for Generalized Meshes
Proceedings of the IFIP WG10.3 Working Conference on Applications in Parallel and Distributed Computing
| Hi-index | 0.00 |
In this paper, we present a general methodology for the improvement of the criteria of a given routing scheme. We study particularly the correlation between deadlock-avoidance and paths' stretch factor [28]. We prove that the methodology preserves deadlock-avoidance. As the methodology starts from a primary communication scheme, we choose routing by Eulerian cycle rules [27] as the primary scheme. To validate the methodology, we apply the resulting routing scheme to the torus network. Then, making a judicious choice with regard to certain parameters, we prove that the result is an adaptive, deadlock-free, minimal and storage efficient routing algorithm for such networks.