Deterministic permutation routing on meshes

We present new deterministic algorithms for routing permutations on a two-dimensional n /spl times/ n MIMD mesh. One algorithm runs in the optimal time 2 /spl times/ n - 2, while the maximal number of packets stored in a processing unit is bounded to 81. Another algorithm runs in near optimal time, 2 /spl times/ n + O(1), and has maximal queue length only 31.<<ETX>>

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

[2]  Sanguthevar Rajasekaran,et al.  Matching the bisection bound for routing and sorting on the mesh , 1992, SPAA '92.

[3]  Adi Shamir,et al.  An optimal sorting algorithm for mesh connected computers , 1986, STOC '86.

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

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

[6]  Michael Kaufmann,et al.  Shorter Queues for Permutation Routing on Meshes , 1994, MFCS.

[7]  Hartmut Schmeck,et al.  Systolic Sorting on a Mesh-Connected Network , 1985, IEEE Transactions on Computers.

[8]  Ulrich Meyer,et al.  Towards practical permutation routing on meshes , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[9]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1976, STOC '76.

[10]  Thomas Stricker.  Supporting the hypercube programming model on mesh architectures: (a fast sorter for iWarp tori) , 1992, SPAA '92.

[11]  Manfred Kunde.  Concentrated regular data streams on grids: sorting and routing near to the bisection bound , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[12]  Sanguthevar Rajasekaran,et al.  Optimal routing algorithms for mesh-connected processor arrays , 1988, Algorithmica.

[13]  Jun Gu,et al.  Two Packet Routing Algorithms on a Mesh-Connected Computer , 1995, IEEE Trans. Parallel Distributed Syst..

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

[15]  Fillia Makedon,et al.  A 2n−2 step algorithm for routing in ann ×n array with constant-size queues , 1995, SPAA '89.

[16]  Jop F. Sibeyn,et al.  Desnakification of Mesh Sorting Algorithms , 1994, ESA.