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
SIAM Journal on Computing
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Journal of Parallel and Distributed Computing
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Automatic text processing: the transformation, analysis, and retrieval of information by computer
Optimal merging and sorting on the EREW PRAM
Information Processing Letters
Merging multiple lists on hierarchical-memory multiprocessors
Journal of Parallel and Distributed Computing - Special issue on shared-memory multiprocessors
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Work-Time Optimal k-Merge Algorithms on the PRAM
IEEE Transactions on Parallel and Distributed Systems
Work-Time Optimal K-Merge Algorithms on the PRAM
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
ClusterNet: An Object-Oriented Cluster Network
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Parallel sorting on ILLIAC array processor
ISTASC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Systems Theory and Scientific Computation - Volume 7
ROE sorting on ILLIAC array processor
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
Hi-index | 0.00 |
The problem of merging k (k驴 2) sorted lists is considered. We give an optimal parallel algorithm which takes $O({\textstyle{{n\log k} \over p}}+\log n)$ time using p processors on a parallel random access machine that allows concurrent reads and exclusive writes, where n is the total size of the input lists. This algorithm achieves O(log n) time using $p={\textstyle{{n\log k} \over {\log n}}}$ processors. Most of the previous research for this problem has been focused on the case when k = 2. Very recently, parallel solutions for the case when k 2 have been reported. Our solution is the first logarithmic time optimal parallel algorithm for the problem when k驴 2. It can also be seen as a unified optimal parallel algorithm for sorting and merging. In order to support the algorithm, a new processor assignment strategy is also presented.