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. 2nhypercube: O(n2) steps. 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.
|Number of pages||9|
|Journal||IEEE Transactions on Parallel and Distributed Systems|
|State||Published - Nov 1995|
Bibliographical noteFunding Information:
This work was supported in part by the French-Israeli grant for cooperation in computer science, and by a grant from the Israeli Ministry of Science.
- Deflection routing
- packet routing
- parallel algorithms
ASJC Scopus subject areas
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics