The Community for Technology Leaders
Green Image
Issue No. 11 - November (1995 vol. 6)
ISSN: 1045-9219
pp: 1168-1176
<p><it>Abstract</it>—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:<fig><fgb><lit>•<it>n</it>×<it>n</it> Mesh: 7<it>n</it>+<it>o</it>(<it>n</it>) steps. • 2<super><it>n</it></super> hypercube: <it>O</it>(<it>n</it><super>2</super>) steps. •<it>n</it>×<it>n</it> Torus: 4<it>n</it>+<it>o</it>(<it>n</it>) steps.</lit></fgb></fig>The algorithm for the two-dimensional grid is the first to be both deterministic and asymptotically optimal. The algorithm for the 2<super><it>n</it></super>-nodes Boolean cube is the first deterministic algorithm that achieves a complexity of <it>o</it>(2<super><it>n</it></super>) steps.</p>
Deflection routing, packet routing, parallel algorithms.
Assaf Schuster, Ilan Newman, "Hot-Potato Algorithms for Permutation Routing", IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 1168-1176, November 1995, doi:10.1109/71.476188
105 ms
(Ver 3.3 (11022016))