Sorting on an array of processors

The author presents a practical sorting algorithm for a nearest-neighbor connected array of MIMD (multiple-instruction, multiple-data-stream) processors, each handling a significant fraction of the elements to be sorted. The algorithm is communication and CPU-optimal for a linear array, is almost order-preserving, and requires little working memory.<
>