This Article 
 Bibliographic References 
 Add to: 
Two Packet Routing Algorithms on a Mesh-Connected Computer
April 1995 (vol. 6 no. 4)
pp. 436-440

Abstract—In this paper, 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\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 $12t_s/s$ where $t_s$ is the time for sorting an $s\times s$ mesh into a row major order for all $s\geq 1$. This result improves the previous queue size $18.67t_s/s$.

Index Terms—Parallel algorithms, mesh-connected computer, packet routing, queue size, time complexity.

[1] Vitesse Semiconductor Corp.,“Vitesse gallium arsenide e/d process and foundry design,”1991.
[2] Q. P. Gu and J. Gu,“Algorithms and average time bounds of sorting on a mesh connected computer,”IEEE Trans. Parallel and Distrib. Syst., vol. 5, pp. 308-315, 1994.
[3] ——,“Packet routing algorithms on a mesh-connected computer,”Dep. Elec. Comput. Eng., Univ. Calgary, Tech. Rep. UCECE-TR-92-007, 1992.
[4] D. Krizanc,S. Rajasekaran, and Th. Tsantilas,"Optimal Routing Algorithms for Mesh-Connected Processor Arrays," Proc. VLSI Algorithms and Architectures (AWOC'88), J. Reif, ed., Lecture Notes in Computer Science 319, pp. 411-422, 1988.
[5] M. Kunde,“Optimal sorting on multi-dimensionally mesh connected computers,”inProc. 4th Symp. Theoretical Aspects on Comput. Lecture Notes in Comput. Sci. 247, 1987, pp. 408–419.
[6] M. Kunde,"Routing and Sorting on Mesh-Connected Arrays," Proc. VLSI Algorithms and Architectures (AWOC'88), J. Reif, ed., Lecture Notes in Computer Science 319, pp. 423-433, 1988.
[7] F.T. Leighton,F. Makedon, and I.G. Tollis,"A 2n - 2 Algorithm for Routing in an n×n Array With Constant Size Queues," Proc. ACM Symp. Parallel Algorithms and Architectures, SPAA'89, pp. 328-335, June 1989.
[8] D. Nassimi and S. Sahni,“An optimal routing algorithm for mesh-connected parallel computers,”J. ACM, pp. 6–29, 1980.
[9] N. Pippenger,“Parallel communication with limited buffers,”inProc. IEEE Symp. Foundations of Comput. Sci., 1984, pp. 127–136.
[10] C. Raghavendra and V. Kumar,“Permutations on ILLIAC IV-type networks,”IEEE Trans. Comput., pp. 662–669, 1986.
[11] S. Rajasekaran and R. Overholt,"Constant Queue Routing on a Mesh," J. Parallel and Distributed Computing, vol. 15, pp. 160-166, 1992.
[12] I. Scherson and S. Sen,“Parallel sorting in two dimensional VLSI models of computation,”IEEE Trans. Comput., vol. 32, pp. 238–249, 1989.
[13] C. Schnorr and A. Shamir,“An optimal sorting algorithm for mesh connected computers,”inProc. 18th ACM Symp. on Theory of Comput., 1986, pp. 263–271.
[14] Q. F. Stout,“Mapping vision algorithms to parallel architectures,”inProc. IEEE, Special Issue on Computer Vision, Aug. 1988, pp. 982–995.
[15] C. Thompson and H. Kung,“Sorting on a mesh connected parallel computer,”Commun. ACM, vol. 20, pp. 263–271, 1977.
[16] J. D. Ullman.Computational Aspects of VLSI. Rockville, MD: Computer Science, 1984.
[17] E. Upfal,“Efficient schemes for parallel communication,”J. ACM, pp. 507–517, 1984.
[18] L.G. Valiant and G.J. Brebner,"Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263-277, May 1981.

Qian-Ping Gu, Jun Gu, "Two Packet Routing Algorithms on a Mesh-Connected Computer," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 4, pp. 436-440, April 1995, doi:10.1109/71.372798
Usage of this product signifies your acceptance of the Terms of Use.