Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks

Luis Gravano, Gustavo D. PifarrC, Pablo E. Berman, and Jorge L. C. Sanz, Fellow, ZEEE Abstract-This paper consists of two parts. In the first part, two new algorithms for deadlock- and livelock-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-adaptive minimal, that is, all paths with a minimal number of hops from source to destination are available 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 require- ment 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 evaluate'd using a dynamic message injection model and different tr&c patterns and message lengths.

[1]  P. Merlin,et al.  Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock , 1980, IEEE Transactions on Communications.

[2]  Jorge L. C. Sanz,et al.  A Simple Mechanism for Efficient Barrier Synchronization in MIMD Machines , 1990, ICPP.

[3]  William J. Dally,et al.  Design of a Self-Timed VLSI Multicomputer Communication Controller, , 1987 .

[4]  Luis Gravano,et al.  Fully-adaptive routing: packet switching performance and wormhole algorithms , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[5]  Lawrence Snyder,et al.  The chaos router: a practical application of randomization in network routing , 1990, SPAA '90.

[6]  José Duato.  Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[7]  Luis Gravano,et al.  Routing techniques for massively parallel communication , 1991, Proc. IEEE.

[8]  Smaragda Konstantinidou,et al.  Adaptive, minimal routing in hypercubes , 1990 .

[9]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[10]  Shekhar Y. Borkar,et al.  iWarp: an integrated solution to high-speed parallel computing , 1988, Proceedings. SUPERCOMPUTING '88.

[11]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[12]  Nicholas Pippenger,et al.  Parallel Communication with Limited Buffers (Preliminary Version) , 1984, FOCS.

[13]  Paul Y. Song.  Design of a network for concurrent message passing systems , 1988 .

[14]  DAVID GELERNTER.  A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks , 1981, IEEE Transactions on Computers.

[15]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[16]  S. Konstantinidou,et al.  The chaos router: a practical application of randomization in network routing , 1991, SIGARCH Comput. Archit. News.

[17]  Frank Thomson Leighton,et al.  Average case analysis of greedy routing algorithms on arrays , 1990, SPAA '90.

[18]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[19]  William J. Dally.  Virtual-channel flow control , 1990, ISCA '90.

[20]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

[21]  Eli Upfal,et al.  An O(log N) deterministic packet-routing scheme , 1992, JACM.

[22]  Sandeep N. Bhatt,et al.  The fluent abstract machine , 1988 .

[23]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[24]  S. Konstantinidou,et al.  Chaos router: architecture and performance , 1991, [1991] Proceedings. The 18th Annual International Symposium on Computer Architecture.

[25]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[26]  Luis Gravano,et al.  Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks , 1991, SPAA '91.

[27]  Luis Gravano,et al.  Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal Storage , 1992, ICPP.

[28]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[29]  Eli Upfal,et al.  An O(logN) deterministic packet routing scheme , 1989, STOC '89.

[30]  Bruce M. Maggs,et al.  Expanders might be practical: fast algorithms for routing around faults on multibutterflies , 1989, 30th Annual Symposium on Foundations of Computer Science.

[31]  Charles L. Seitz,et al.  A Framework for Adaptive Routing , 1987 .

[32]  Jorge L. C. Sanz,et al.  A Comparison of SIMD Hypercube Routing Strategies , 1991, ICPP.

[33]  Lionel M. Ni,et al.  The turn model for adaptive routing , 1992, ISCA '92.

[34]  Eli Upfal,et al.  A theory of wormhole routing in parallel computers , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[35]  Luis Gravano,et al.  Requirements for deadlock-free, adaptive packet routing , 1992, PODC '92.