The Community for Technology Leaders
Green Image
<p>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.</p>
Index Termsperformance evaluation; hypercube networks; network routing; concurrency control;parallel algorithms; parallel architectures; adaptive deadlock routing; livelock-free routing; hypercube network; wormhole routing; routing node; derouting; Subcubes; partitioning; partially adaptive algorithms; Hanging algorithm; Zenith algorithm; Hanging-Order algorithm; Nonminimal algorithm; Subcubes algorithm; Dimension-Order; E-Cube routing algorithm; Fully Adaptive Minimal algorithm
G. Denicolay, L. Gravano, J.L.C. Sanz, G.D. Pifarré, "Adaptive Deadlock- and Livelock-Free Routing in the Hypercube Network", IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 1121-1139, November 1994, doi:10.1109/71.329674
85 ms
(Ver 3.3 (11022016))