The Community for Technology Leaders
Green Image
<p>This paper consists of two parts. In the first part, two new algorithms for deadlock- andlivelock-free wormhole routing in the torus network are presented. The first algorithm,called Channels, is for the n-dimensional torus network. This technique is fully-adaptiveminimal, that is, all paths with a minimal number of hops from source to destination areavailable for routing, and needs only five virtual channels per bidirectional link, the lowest channel requirement known in the literature for fully-adaptive minimal worm-hole routing. In addition, this result also yields the lowest buffer requirement known in the literature for packet-switched fully-adaptive minimal routing. The second algorithm, called 4-Classes, is for the bidimensional torus network. This technique is fully-adaptive minimal and requires only eight virtual channels per bidirectional link. Also, it allows for a highly parallel implementation of its associated routing node. In the second part of this paper, four worm-hole routing techniques for the two-dimensional torus are experimentally evaluated using a dynamic message injection model and different traffic patterns and message lengths.</p>
Index Termsconcurrency control; multiprocessor interconnection networks; performance evaluation;adaptive deadlock-free routing; livelock-free routing; minimal paths; torus networks;Channels; n-dimensional torus network; virtual channels; buffer requirement;packet-switched fully-adaptive minimal routing; 4-Classes; dynamic message injectionmodel; traffic patterns; message lengths

J. Sanz, G. Pifarré, P. Berman and L. Gravano, "Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 1233-1251, 1994.
90 ms
(Ver 3.3 (11022016))