# Item

ITEM ACTIONSEXPORT

Released

Report

#### Towards practical permutation routing on meshes

##### MPS-Authors

##### Locator

There are no locators available

##### Fulltext (public)

MPI-I-94-153.pdf

(Any fulltext), 187KB

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Kaufmann, M., Meyer, U., & Sibeyn, J. F.(1994). *Towards
practical permutation routing on meshes* (MPI-I-94-153). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B53F-0

##### Abstract

We consider the permutation routing problem on two-dimensional $n
\times n$ meshes. To be practical, a routing algorithm is required
to ensure very small queue sizes $Q$, and very low running time $T$,
not only asymptotically but particularly also for the practically
important $n$ up to $1000$. With a technique inspired by a
scheme of Kaklamanis/Krizanc/Rao, we obtain a near-optimal result:
$T = 2 \cdot n + {\cal O}(1)$ with $Q = 2$. Although $Q$ is very
attractive now, the lower order terms in $T$ make this algorithm
highly impractical. Therefore we present simple schemes which are
asymptotically slower, but have $T$ around $3 \cdot n$ for {\em all}
$n$ and $Q$ between 2 and 8.