The Community for Technology Leaders
RSS Icon
Issue No.04 - April (1995 vol.6)
pp: 436-440
<p><it>Abstract—</it>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 <math><tmath>$n\times n$</tmath></math> mesh-connected computer in <math><tmath>$2n+O(1)$</tmath></math> steps. This improves the previous queue size of <math><tmath>$75$</tmath></math>. The second algorithm solves the 1-1 routing problem in <math><tmath>$2n-2$</tmath></math> steps with queue size <math><tmath>$12t_s/s$</tmath></math> where <math><tmath>$t_s$</tmath></math> is the time for sorting an <math><tmath>$s\times s$</tmath></math> mesh into a row major order for all <math><tmath>$s\geq 1$</tmath></math>. This result improves the previous queue size <math><tmath>$18.67t_s/s$</tmath></math>.</p><p><it>Index Terms—</it>Parallel algorithms, mesh-connected computer, packet routing, queue size, time complexity.</p>
Qian-Ping Gu, Jun Gu, "Two Packet Routing Algorithms on a Mesh-Connected Computer", IEEE Transactions on Parallel & Distributed Systems, vol.6, no. 4, pp. 436-440, April 1995, doi:10.1109/71.372798
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool