Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations
Issue No. 03 - March (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.277792
<p>This paper deals with the problem of packet-switched routing in parallel machines.Several new routing algorithms for different interconnection networks are presented.While the new techniques apply to a wide variety of networks, routing algorithms will beshown for the hypercube, the two-dimensional mesh, and the shuffle-exchange. Althoughthe new techniques are designed for packet routing, they can be used alternatively forvirtual cut-through routing models. The techniques presented for hypercubes and meshesare fully-adaptive and minimal. A fully-adaptive and minimal routing is one in which allpossible minimal paths between a source and a destination are of potential use at thetime a message is injected into the network. Minimal paths followed by messagesultimately depend on the local congestion encountered in each node of the network. Allof the new techniques are completely free of deadlock situations.</p>
Index Termsmultiprocessor interconnection networks; concurrency control; parallel machines;message passing; packet switching; adaptive minimal deadlock-free packet routing;hypercubes; meshes; algorithms; simulations; parallel machines; routing algorithms;multiprocessor interconnection networks; shuffle-exchange; two-dimensional mesh;packet routing; virtual cut-through routing models; minimal paths; deadlock
S. Felperin, J. Sanz, L. Gravano and G. Pifarré, "Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 247-263, 1994.