A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Parallel Sorting Algorithms
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
Percentile finding algorithm for multiple sorted runs
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Time-Space Optimal Parallel Merging and Sorting
IEEE Transactions on Computers
A Parallel Time/Hardware Tradeoff T.H=O(2/sup n/2/) for the Knapsack Problem
IEEE Transactions on Computers
Sorting with Linear Speedup on a Pipelined Hypercube
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
An effective algorithm for parallelizing sort merge joins in the presence of data skew
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
IEEE Transactions on Parallel and Distributed Systems
A Parallel Sort Merge Join Algorithm for Managing Data Skew
IEEE Transactions on Parallel and Distributed Systems
Parallel Median Splitting and k-Splitting with Application to Merging and Sorting
IEEE Transactions on Parallel and Distributed Systems
Work-Time Optimal k-Merge Algorithms on the PRAM
IEEE Transactions on Parallel and Distributed Systems
Optimal parallel algorithm for the knapsack problem without memory conflicts
Journal of Computer Science and Technology
Parallel merging with restriction
The Journal of Supercomputing
Provably good multicore cache performance for divide-and-conquer algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
OpenMP tasks in IBM XL compilers
CASCON '08 Proceedings of the 2008 conference of the center for advanced studies on collaborative research: meeting of minds
OpenMP tasking analysis for programmers
CASCON '09 Proceedings of the 2009 Conference of the Center for Advanced Studies on Collaborative Research
International Journal of Computers and Applications
Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture
The Journal of Supercomputing
Merging data records on EREW PRAM
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
An adaptive parallel hierarchical clustering algorithm
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Efficient MPI implementation of a parallel, stable merge algorithm
EuroMPI'12 Proceedings of the 19th European conference on Recent Advances in the Message Passing Interface
DANBI: dynamic scheduling of irregular stream programs for many-core systems
PACT '13 Proceedings of the 22nd international conference on Parallel architectures and compilation techniques
Proceedings of Programming Models and Applications on Multicores and Manycores
| Hi-index | 15.00 |
A parallel algorithm is described for merging two sorted vectors of total length N. The algorithm runs on a shared-memory model of parallel computation that disallows more than one processor to simultaneously read from or write into the same memory location. It uses k processors where l - k - N and requires O(N/k + log k - log N) time. The proposed approach for merging leads to a parallel sorting algorithm that sorts a vector of length N in O(log2 k + N/k) log N) time. Because they modify their behavior and hence their running time according to the number of available processors, the two new algorithms are said to be self-reconfiguring. In addition, both algorithms are optimal, for k - N/log2 N, in view of the (N) and (N log N) lower bounds on merging and sorting, respectively.