Two Packet Routing Algorithms on a Mesh-Connected Computer

We give two algorithms for the 1-1 routing problems on a mesh-connected computer. The first algorithm, with queue size 28, solves the 1-1 routing problem on an n/spl times/n mesh-connected computer in 2n+O(1) steps. This improves the previous queue size of 75. The second algorithm solves the 1-1 routing problem in 2n-2 steps with queue size 12 t/sub ss where t/sub s/ is the time for sorting an s/spl times/s mesh into a row major order for all s/spl ges/1. This result improves the previous queue size 18.67 t/sub ss. >

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

[2]  Quentin F. Stout,et al.  Mapping vision algorithms to parallel architectures , 1988, Proc. IEEE.

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

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

[5]  Eli Upfal,et al.  Efficient schemes for parallel communication , 1982, PODC '82.

[6]  Manfred Kunde.  Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers , 1987, STACS.

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

[8]  Viktor K. Prasanna,et al.  Permutations on Illiac IV-Type Networks , 1986, IEEE Transactions on Computers.

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

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

[11]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[12]  Sartaj Sahni,et al.  An optimal routing algorithm for mesh-connected Parallel computers , 1980, JACM.

[13]  Isaac D. Scherson,et al.  Parallel Sorting in Two-Dimensional VLSI Models of Computation , 1989, IEEE Trans. Computers.

[14]  Qian-Ping Gu,et al.  Routing algorithms on a mesh-connected computer , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

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

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

[17]  Jun Gu,et al.  Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer , 1994, IEEE Trans. Parallel Distributed Syst..