Deterministic Permutation Routing on Meshes

@inproceedings{Chlebus1993DeterministicPR,
  title={Deterministic Permutation Routing on Meshes},
  author={Bogdan S. Chlebus and Michael Kaufmann and Jop F. Sibeyn},
  booktitle={SPDP},
  year={1993}
}
We present a new deterministic algorithm for routing permutations on a two-dimensional MIMD mesh. The algorithm runs in the optimal time 2n ? 2 on an n n mesh, and the maximal number of packets stored in a processing unit is 81. A modiication of the algorithm , running in time 2n + O(1), has the maximal queue length of only 31. The algorithm is simple, no connict-resolution strategy is required.