Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
Permutations on Illiac IV-Type Networks
IEEE Transactions on Computers
An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Parallel Sorting in Two-Dimensional VLSI Models of Computation
IEEE Transactions on Computers
A 2n-2 step algorithm for routing in an nxn array with constant size queues
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Constant queue routing on a mesh
Journal of Parallel and Distributed Computing
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer
Communications of the ACM
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
Optimal Routing Algorithms for Mesh-Connected Processor Arrays
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Routing and Sorting on Mesh-Connected Arrays
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI
Oblivious Routing Algorithms on the Mesh of Buses
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
| Hi-index | 0.00 |
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.