An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Some parallel sorts on a mesh-connected processor array and their time efficiency
Journal of Parallel and Distributed Computing
Lower bounds for sorting on Mesh-connected architectures
Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
Optimal sorting on multi-dimensionally mesh-connected computers
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
Parallel Sorting in Two-Dimensional VLSI Models of Computation
IEEE Transactions on Computers
Analysis and applications of the orthogonal access multiprocessor
Journal of Parallel and Distributed Computing
Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Sorting on a mesh-connected parallel computer
Communications of the ACM
Parallel Sorting Algorithms
Orthogonal Graphs for the Construction of a Class of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
The Vesta parallel file system
ACM Transactions on Computer Systems (TOCS)
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
Simulating the bitonic sort using P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Hamilton cycles in restricted rotator graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
| Hi-index | 0.03 |
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.