Multi-packet selection on mesh-connected processor arrays

The authors show efficient, deterministic algorithms for selection on the mesh-connected processor array, in the case when there are several elements at every processor. In particular, on a p-processor mesh, with N⩾p elements, stored N/p at every processor, they show that selection can be performed in O(min{plog^N/_p, max{N/p^2/3, √p¯}}) communication steps. The best previously known results were based on sorting and required O(N/√p¯) communication steps, for N⩾p