Hot-Potato Algorithms for Permutation Routing

Ilan Newman; Assaf Schuster

doi:10.1109/71.476188

Hot-Potato Algorithms for Permutation Routing

Ilan Newman, Assaf Schuster

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	1168-1176
Number of pages	9
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	6
Issue number	11
DOIs	https://doi.org/10.1109/71.476188
State	Published - 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.

Keywords

Deflection routing
packet routing
parallel algorithms

ASJC Scopus subject areas

Signal Processing
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/71.476188

Cite this

@article{4c93c6a8453942d089f821501996de73,

title = "Hot-Potato Algorithms for Permutation Routing",

abstract = "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.",

keywords = "Deflection routing, packet routing, parallel algorithms",

author = "Ilan Newman and Assaf Schuster",

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.",

year = "1995",

month = nov,

doi = "10.1109/71.476188",

language = "English",

volume = "6",

pages = "1168--1176",

journal = "IEEE Transactions on Parallel and Distributed Systems",

issn = "1045-9219",

publisher = "IEEE Computer Society",

number = "11",

}

TY - JOUR

T1 - Hot-Potato Algorithms for Permutation Routing

AU - Newman, Ilan

AU - Schuster, Assaf

N1 - 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.

PY - 1995/11

Y1 - 1995/11

N2 - 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.

AB - 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.

KW - Deflection routing

KW - packet routing

KW - parallel algorithms

UR - http://www.scopus.com/inward/record.url?scp=0029405992&partnerID=8YFLogxK

U2 - 10.1109/71.476188

DO - 10.1109/71.476188

M3 - Article

AN - SCOPUS:0029405992

SN - 1045-9219

VL - 6

SP - 1168

EP - 1176

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

IS - 11

ER -

Hot-Potato Algorithms for Permutation Routing

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this