Optimal parallel merging and sorting without memory conflicts
IEEE Transactions on Computers
Operating systems concepts
SIAM Journal on Computing
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Design of parallel mergesort and quicksort algorithms
Design of parallel mergesort and quicksort algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Parallelizing Merge Sort onto Distributed Memory Parallel Computers
ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing
Performance modeling and analysis of correlated parallel computations
Parallel Computing
| Hi-index | 0.00 |
Multiple-instruction multiple-data (MIMD) algorithms that use multiple processors to domedian splitting, k-splitting and parallel splitting into t equal sections are presented. Bothconcurrent read, exclusive write (CREW) and exclusive read, exclusive write (EREW)versions of the algorithms are given. It is shown that a k-splitting problem can be easilyconverted into a median-splitting problem. Methods for finding multiple split points quickly and application of k-splitting to merging and sorting are discussed.