ROMM routing on mesh and torus networks

ROMM is a class of Randomized, Oblivious, Multi--phase, Minimal routing algorithms. ROMM routing offers a potential for improved performance compared to both fully randomized algorithms and deterministic oblivious algorithms, under both light and heavy loads. ROMM routing also offers close to best case performance for many common routing problems. In previous work, these claims were supported by extensive simulations on binary cube networks [30, 31]. Here we present analytical and empirical results for ROMM routing on wormhole routed mesh and torus networks. Our simulations show that ROMM algorithms can perform several representative routing tasks 1.5 to 3 times faster than fully randomized algorithms, for medium--sized networks. Furthermore, ROMM algorithms are always competitive with deterministic, oblivious routing, and in some cases, up to 2 times faster.

[1]  K. Gunther,et al.  Prevention of Deadlocks in Packet-Switched Data Transport Systems , 1981 .

[2]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[3]  Luis Gravano,et al.  Adaptive Deadlock- and Livelock-Free Routing in the Hypercube Network , 1994, IEEE Trans. Parallel Distributed Syst..

[4]  Charles L. Seitz,et al.  The design of the Caltech Mosaic C multicomputer , 1993 .

[5]  Michael J. Pertel.  A Critique of Adaptive Routing , 1992 .

[6]  Luis Gravano,et al.  Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks , 1994, IEEE Trans. Computers.

[7]  Yuh-Dauh Lyuu,et al.  An information dispersal approach to issues in parallel processing , 1990 .

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

[9]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[10]  Michael D. Noakes,et al.  The J-machine multicomputer: an architectural evaluation , 1993, ISCA '93.

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

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

[13]  S. Lennart Johnsson,et al.  ROMM Routing: A Class of Efficient Minimal Routing Algorithms , 1994, PCRCW.

[14]  Robert Wille,et al.  The chaos router chip: design and implementation of an adaptive router , 1993, VLSI.

[15]  S. Lennart Johnsson,et al.  Minimizing the Communication Time for Matrix Multiplication on Multiprocessors , 1993, Parallel Comput..

[16]  Donald Yeung,et al.  THE MIT ALEWIFE MACHINE: A LARGE-SCALE DISTRIBUTED-MEMORY MULTIPROCESSOR , 1991 .

[17]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[18]  G.D. Pifarre,et al.  Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations , 1994, IEEE Trans. Parallel Distributed Syst..

[19]  Luis Gravano,et al.  Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks , 1992, SPAA '92.

[20]  Lionel M. Ni,et al.  The Turn Model for Adaptive Routing , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

[21]  Luis Gravano,et al.  Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[22]  W. Daniel Hillis,et al.  The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..

[23]  Anoop Gupta,et al.  The DASH prototype: implementation and performance , 1992, ISCA '92.

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

[25]  W. Daniel Hillis,et al.  The network architecture of the Connection Machine CM-5 (extended abstract) , 1992, SPAA '92.

[26]  William J. Dally,et al.  Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..

[27]  William J. Dally,et al.  Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[28]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

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

[30]  Wolfgang J. Paul,et al.  On the Physical Design of PRAMs , 1992, Comput. J..

[31]  S. Lennart Johnsson,et al.  An Efficient Algorithms for Gray-to-Binary Permutation on Hypercubes , 1994, J. Parallel Distributed Comput..

[32]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[33]  Pedro López,et al.  Performance Evaluation of Adaptive Routing Algorithms for k-ary-n-cubes , 1994, PCRCW.

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

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

[36]  S. Lennart Johnsson,et al.  On the Conversion Between Binary Code and Binary-Reflected Gray Code on Binary Cubes , 1995, IEEE Trans. Computers.

[37]  Abhiram G. Ranade,et al.  How to emulate shared memory (Preliminary Version) , 1987, FOCS.

[38]  Lawrence Snyder,et al.  The Chaos Router , 1994, IEEE Trans. Computers.

[39]  Sudhakar Yalamanchili,et al.  Adaptive routing protocols for hypercube interconnection networks , 1993, Computer.

[40]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[41]  Charles L. Seitz,et al.  A framework for adaptive routing in multicomputer networks , 1989, CARN.

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

[43]  Frank Thomson Leighton,et al.  Methods for message routing in parallel machines , 1992, STOC '92.