max planck institut
informatik

# MPI-I-94-153

## Towards practical permutation routing on meshes

### Kaufmann, Michael and Meyer, Ulrich and Sibeyn, Jop F.

MPI-I-94-153. October 1994, 11 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:

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.
Acknowledgement:
References to related material:

MPI-I-94-153.pdf59 KBytes; 187 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1994-153
BibTeX
@TECHREPORT{KaufmannMeyerSibeyn94,
AUTHOR = {Kaufmann, Michael and Meyer, Ulrich and Sibeyn, Jop F.},
TITLE = {Towards practical permutation routing on meshes},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},