Permutations on Illiac IV-Type Networks
IEEE Transactions on Computers
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
Acta Informatica
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
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
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI
Definition and analysis of a class of spanning bus orthogonal multiprocessing systems
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Optimal bounded-degree VLSI networks for sorting in a constant number of rounds
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
A New Class of Optimal Bounded-Degree VLSI Sorting Networks
IEEE Transactions on Computers
Two Packet Routing Algorithms on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
Parallel algorithms for the orthogonal multiprocessor
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Orthogonal Graphs for the Construction of a Class of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Sorting in Mesh Connected Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
An AT2 Optimal Mapping of Sorting onto the Mesh Connected Array without Comparators
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
ROE sorting on ILLIAC array processor
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture
The Journal of Supercomputing
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 14.99 |
The gradual refinement of a general approach to two-dimensional sorting, the shear-sort algorithm, to more sophisticated and specialized sorting algorithms on mesh-connected computers is described. The analysis of the shear-sort algorithm gives rise to a novel perspective of two-dimensional sorting, which seems to be a very powerful tool for developing efficient algorithms. The same methods can be extended for sorting in higher dimensions, for example, in the three-dimensional mesh. The concept of clean and dirty rows can be modified to clean and dirty planes (or hyperplanes for dimensions greater than three). Although only two schemes (purely recursive and iterative) are explicitly described, the reader may construct his own algorithm using similar technique and slight modifications. Designing an O(n) algorithm for sorting on a mesh becomes much simpler using the techniques developed.