Minimal Adaptive Routing on the Mesh with Bounded Queue Size

An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around “hot spots.” Minimal adaptive routing algorithms have the additional advantage that the path each packet takes is a shortest one. For a large class of minimal adaptive routing algorithms, we present an ?(n2/k2) bound on the worst case time to route a static permutation of packets on ann×nmesh or torus with nodes that can hold up tok? 1 packets each. This is the first nontrivial lower bound on adaptive routing algorithms. The argument extends to more general routing problems, such as theh?hrouting problem. It also extends to a large class of dimension order routing algorithms, yielding an ?(n2/k) time bound. To complement these lower bounds, we present two upper bounds. One is anO(n2/k+n) time dimension order routing algorithm that matches the lower bound. The other is the first instance of a minimal adaptive routing algorithm that achievesO(n) time with constant sized queues per node. We point out why the latter algorithm is outside the model of our lower bounds.

[1]  Manfred Kunde Routing and Sorting on Mesh-Connected Arrays , 1988, AWOC.

[2]  Michael D. Noakes,et al.  System design of the J-Machine , 1990 .

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

[4]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[5]  Satish Rao,et al.  Hot-potato routing on processor arrays , 1993, ACM Symposium on Parallelism in Algorithms and Architectures.

[6]  Christos Kaklamanis,et al.  Tight bounds for oblivious routing in the hypercube , 1990, SPAA '90.

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

[8]  Sanguthevar Rajasekaran,et al.  Constant Queue Routing on a Mesh , 1992, J. Parallel Distributed Comput..

[9]  Andrew A. Chien,et al.  Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.

[10]  Danny Krizanc Oblivious Routing with Limited Buffer Capacity , 1991, J. Comput. Syst. Sci..

[11]  Rene L. Cruz,et al.  Bounds on Maximum Delay in Networks with Deflection Routing , 1995, IEEE Trans. Parallel Distributed Syst..

[12]  Taisook Han,et al.  Move and Smooth Routing Algorithms on Mesh-connected Computers , 1990 .

[13]  Assaf Schuster,et al.  A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms , 1996, ESA.

[14]  Assaf Schuster,et al.  Hot-Potato Algorithms for Permutation Routing , 1995, IEEE Trans. Parallel Distributed Syst..

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

[16]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[17]  Fillia Makedon,et al.  A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues , 1989, SPAA.

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

[19]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[20]  Baruch Schieber,et al.  Fast deflection routing for packets and worms , 1993, PODC '93.

[21]  Uriel Feige,et al.  Exact analysis of hot-potato routing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.