MPI-INF/SWS Research Reports 1991-2021

2. Number - only D1


Towards practical permutation routing on meshes

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

October 1994, 11 pages.

Status: available - back from printing

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.

  • Attachement: (59 KBytes); MPI-I-94-153.pdf (187 KBytes)

URL to this document:

Hide details for BibTeXBibTeX
  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},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-94-153},
  MONTH = {October},
  YEAR = {1994},
  ISSN = {0946-011X},