Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
The connection machine
An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Sharp approximation models of adaptive routing in mesh networks (preliminary report)
Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Hot-potato routing on processor arrays
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Fast Deterministic Hot-Potato Routing on Processor Arrays
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Bounds on evacuation time for deflection routing
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
Optimal deterministic protocols for mobile robots on a grid
Information and Computation
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Networks on which hot-potato routing does not livelock
Distributed Computing
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
A new bound for pure greedy hot potato routing
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Deterministic hot-potato permutation routing on the mesh and the torus
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Potential Function Analysis of Greedy Hot-Potato Routing
Theory of Computing Systems
| Hi-index | 0.00 |
We develop a methodology for the design of hot-potato algorithms for routing permutations. The basic idea is to convert existing store-and-forward routing algorithms to hot-potato algorithms. Using it, we obtain the following complexity bounds for permutation routing:驴n脳n Mesh: 7n+o(n) steps.驴 2n hypercube: O(n2) steps.驴n脳n Torus: 4n+o(n) steps.The algorithm for the two-dimensional grid is the first to be both deterministic and asymptotically optimal. The algorithm for the 2n-nodes Boolean cube is the first deterministic algorithm that achieves a complexity of o(2n) steps.