An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The connection machine
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Matching the bisection bound for routing and sorting on the mesh
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Randomized single-target hot-potato routing
Journal of Algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Packet routing in fixed-connection networks: a survey
Journal of Parallel and Distributed Computing
Randomized greedy hot-potato routing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Hot-Potato Algorithms for Permutation Routing
IEEE Transactions on Parallel and Distributed Systems
Mosaic C: An Experimental Fine-Grain Multicomputer
Proceedings of the International Conference on Future Tendencies in Computer Science, Control and Applied Mathematics
Exact analysis of hot-potato routing
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
A new bound for pure greedy hot potato routing
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
In this paper we consider deterministic hot-potato routing algorithms on n × n meshes and tori. We present algorithms for the permutation routing problem on these networks and achieve new upper bounds. The basic ideas used in the presented algorithms are sorting, packet concentration and fast algorithms for one-dimensional submeshes. Using this ideas we solve the permutation routing problem in 3.25n+o(n) steps on an n × n mesh and in 2.75n + o(n) steps on an n × n torus.