Hot-Potato Algorithms for Permutation Routing

Ilan Newman, Assaf Schuster

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)1168-1176
Number of pages9
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number11
StatePublished - Nov 1995

Bibliographical note

Funding 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


Dive into the research topics of 'Hot-Potato Algorithms for Permutation Routing'. Together they form a unique fingerprint.

Cite this