The connection machine
An adaptive communications protocol for network computers
Performance Evaluation
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Warp: an integrated solution of high-speed parallel computing
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Proceedings of the fifth MIT conference on Advanced research in VLSI
The chaos router: a practical application of randomization in network routing
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Adaptive, minimal routing in hypercubes
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Chaos router: architecture and performance
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Fully-adaptive routing: packet switching performance and wormhole algorithms
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Requirements for deadlock-free, adaptive packet routing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Adaptive Deadlock-Free Worrnhole Routing in Hypercubes
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
A Framework for Adaptive Routing
A Framework for Adaptive Routing
ROMM routing on mesh and torus networks
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Routing in quad tree-hypercube networks
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Homogeneous Routing for Homogeneous Traffic Patterns on Meshes
IEEE Transactions on Parallel and Distributed Systems
Handling very large numbers of messages in distributed hash tables
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
This paper consists of two parts. In the first one, two new algorithms for wormholerouting on the hypercube network are presented. These techniques are adaptive and areensured to be deadlock- and livelock-free. These properties are guaranteed by using asmall number of resources in the routing node. The first algorithm is adaptive andnonminimal and will be referred to as Nonminimal. In this technique, some moderatederouting is allowed in order to alleviate the potential congestion arising from highlystructured communication patterns. The second algorithm, dubbed Subcubes, is adaptiveand minimal, and is based on partitioning the hypercube into subcubes of smallerdimension; This technique requires only two virtual channels per physical link of the node. In the second part of the paper, a wide variety of techniques for wormhole routing in the hypercube are evaluated from an algorithmic point of view. Five partially adaptive algorithms are considered: the Hanging algorithm, the Zenith algorithm, the Hanging-Order algorithm, the Nonminimal algorithm; and the Subcubes algorithm. One oblivious algorithm, the Dimension-Order, or E-Cube routing algorithm, is also used. Finally, a Fully Adaptive Minimal algorithm is tried. A simple node model was designed and adapted to all the algorithms.