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.<
>