Universal Wormhole Routing

We examine the wormhole routing problem in terms of the "congestion" c and "dilation" d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O(cd/spl eta/+d/spl eta/ log P) time with high probability, where L is the number of flits in a packet, and /spl eta/=min {d, L}; only a constant number of flits are stored in each queue at any time. Using this result, we show that a fat tree network of area /spl ominus/(A) can simulate wormhole routing on any network of comparable area with O(log/sup 3/ A) slowdown, when all worms have the same length. Variable length worms are also considered. We run some simulations on the fat tree which show that not only does wormhole routing tend to perform better than the more heavily studied store and forward routing in this context, but that performance superior to our provable bound is attainable in practice.

[1]  David A. Bader,et al.  A Parallel Sorting Algorithm With an Experimental Study , 1998 .

[2]  J. Y. Ngai,et al.  A framework for adaptive routing in multicomputer networks , 1989, CARN.

[3]  José Duato,et al.  994 International Conference on Parallel Processing a Necessary and Sufficient Condition for Deadlock-free Adaptive Routing in Wormhole Networks , 2022 .

[4]  Daniel Shawcross Wilkerson,et al.  Nearly tight bounds for wormhole routing , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[5]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[6]  Charles E. Leiserson,et al.  Randomized Routing on Fat-Trees , 1989, Adv. Comput. Res..

[7]  Bruce M. Maggs,et al.  Randomized Routing and Sorting on Fixed-Connection Networks , 1994, J. Algorithms.

[8]  Fillia Makedon,et al.  On bit-serial packet routing for the mesh and the torus , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[9]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

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

[11]  Joydeep Ghosh,et al.  A Comprehensive Analytical Model for Wormhole Routng in Multicomputer Systems , 1994, J. Parallel Distributed Comput..

[12]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[13]  José Duato,et al.  A theory of fault-tolerant routing in wormhole networks , 1994, Proceedings of 1994 International Conference on Parallel and Distributed Systems.

[14]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[15]  Bruce M. Maggs,et al.  Fast algorithms for bit-serial routing on a hypercube , 1990, SPAA '90.

[16]  Manfred Kunde,et al.  Multi-packet-routing on mesh connected arrays , 1989, SPAA '89.

[17]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[18]  Ronald I. Greenberg.  The fat-pyramid: a robust network for parallel computation , 1990 .

[19]  Ronald I. Greenberg,et al.  Packet Routing in Networks with Long Wires , 1995, J. Parallel Distributed Comput..

[20]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[21]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[22]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[23]  Hyeong-Cheol Oh.  Efficient communication schemes for massively parallel computers , 1993 .

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

[25]  Eli Upfal,et al.  A Theory of Wormhole Routing in Parallel Computers , 1996, IEEE Trans. Computers.

[26]  Frank Thomas Hady.  A performance study of wormhole routed networks through analytical modeling and experimentation , 1993 .

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

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

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

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

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

[32]  Ronald I. Greenberg,et al.  The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay , 1994, IEEE Trans. Computers.