Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
Merging with parallel processors
Communications of the ACM
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
New lower bounds for parallel computation
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
New lower bounds for parallel computation
Journal of the ACM (JACM)
Optimal Facility Location under Various Distance Functions
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
A Partitioning Approach to the Design of Selection Networks
IEEE Transactions on Computers
Broadcast Communications and Distributed Algorithms
IEEE Transactions on Computers
Binary Trees and Parallel Scheduling Algorithms
IEEE Transactions on Computers
MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
IEEE Transactions on Computers
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
The Parallel Enumeration Sorting Scheme for VLSI
IEEE Transactions on Computers
IBM Journal of Research and Development
Paper: Hybrid systolic sorters
Parallel Computing
A fast parallel algorithm for routing in permutation networks
IEEE Transactions on Computers
Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture
The Journal of Supercomputing
A cost optimal parallel quicksorting and its implementation on a shared memory parallel computer
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 15.00 |
In this paper, we describe a family of parallel-sorting algorithms for a multiprocessor system. These algorithms are enumeration sortings and comprise the following phases: 1) count acquisition: the keys are subdivided into subsets and for each key we determine the number of smaller keys (count) in every subset; 2) rank determination: the rank of a key is the sum of the previously obtained counts;