A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Optimal parallel merging and sorting without memory conflicts
IEEE Transactions on Computers
Communications of the ACM
SIAM Journal on Computing
Stable duplicate-key extraction with optimal time and space bounds
Acta Informatica
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Stable set and multiset operations in optimal time and space
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Parallel Sorting Algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A Survey of Parallel Algorithms for Shared-Memory Machines
A Survey of Parallel Algorithms for Shared-Memory Machines
Fast set operations using treaps
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
An Efficient General In-Place Parallel Sorting Scheme
The Journal of Supercomputing
| Hi-index | 14.98 |
The authors present a parallel merging algorithm that, on an exclusive-read exclusive-write (EREW) parallel random-access machine (PRAM) with k processors merges two sorted lists of total length n in O(n/k+log n) time and constant extra space per processor, and hence is time-space optimal for any value of kor=n/(log n). The authors also describe how this gives rise to a stable version of the parallel merging algorithm that is similarly time-space optimal on an EREW PRAM. The authors observe that this technique for achieving stability incurs two penalties: a slightly more complicated algorithm and somewhat larger constants of proportionality. These two parallel merges naturally lead to time-space optimal parallel sorting algorithms. Extensions to sorting and open topics for future research are discussed.