Fast General Sorting on Meshes of Arbitrary Dimension Without Routing

@inproceedings{Wanka1991FastGS,
  title={Fast General Sorting on Meshes of Arbitrary Dimension Without Routing},
  author={Rolf Wanka},
  year={1991}
}
In this paper, we present a parallel sorting algorithm for meshes of arbitrary dimension that generalizes two known algorithms for sorting on the two-dimensional mesh and on the hypercube, respectively. It uses a speciic indexing scheme, called generalized snake-like numbering. The algorithm has a running time of O(d 2 m log m) on the d-dimensional mesh with side length m. The advantages of the algorithm are its simplicity and its dispensing with any routing.