Issue No.05 - September (1992 vol.3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.159046
A sorting algorithm, dubbed MeshSort, for multidimensional mesh-connected multiprocessors is introduced. Bitonic Sort and ShearSort are shown to be special cases of MeshSort. MeshSort thus provides some insight into the operation of parallel sorting. It requires operations only along orthogonal vectors of processors, simplifying the control of the multiprocessor. This allows MeshSort to be used on any reduced architecture where a multidimensional memory structure is interconnected with a lower dimensional structure of processors. A modified version of MeshSort, called FastMeshSort, is presented. This algorithm applies the same basic principle as MeshSort, and is almost as simple to implement, but achieves much better performance. The modified algorithm is shown to be very efficient for reasonably sized meshes. FastMeshSort is presented as a practical sorting and routing algorithm for real multidimensional mesh-connected multiprocessors. The algorithms can easily be extended to other multiprocessor structures.
Index Termssorting algorithm; MeshSort; multidimensional mesh-connected multiprocessors; Bitonic Sort; ShearSort; parallel sorting; orthogonal vectors; reduced architecture; multidimensional memory structure; FastMeshSort; routing algorithm; multiprocessor interconnection networks; parallel algorithms; sorting
P.F. Corbett, I.D. Scherson, "Sorting in Mesh Connected Multiprocessors", IEEE Transactions on Parallel & Distributed Systems, vol.3, no. 5, pp. 626-632, September 1992, doi:10.1109/71.159046