Sample Sort on Meshes

In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architectures. We consider the k-k sorting problem in which every PU initially holds k packets. We present well-known randomized and deterministic splitter-based sorting algorithms. We come with a new deterministic sorting algorithm which performs much better than previous ones. The number of routing steps is reduced by a re ned deterministic splitter selection. Hereby deterministic sorting might become competitive with randomized sorting in practice.

• Type: Conference
• Year: 1997
• Where: EUROPAR
• Authors: Jop F. Sibeyn
• Keywords: Deterministic, Distributed And Parallel Computing, EUROPAR 1997, Sorting, Sorting Algorithm