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
Optimal merging and sorting on the EREW PRAM
Information Processing Letters
Introduction to algorithms
Information and Computation
Parallel computation: models and methods
Parallel computation: models and methods
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimal Parallel Merging by Counting
ITNG '07 Proceedings of the International Conference on Information Technology
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
Merging data records on EREW PRAM
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
| Hi-index | 0.00 |
Many data sets to be merged consist of (1) n distinct keys and (2) the keys are serial numbers. Merging such data can be represented as merging two sorted arrays A = (a0, a1, ..., an1--1) and B = (b0, b1, ..., bn2--1) of records such that (1) the keys are distinct; (2) 0 ≤ ai · key, bj · key n, ∀0 ≤ i n1 and 0 ≤j n2, where n = n1 + n2 and key is the primary key of the record. We present an optimal deterministic merging algorithm on EREW PRAM in O(n/p) time, where p is the number of processors and 1≤p≤n. The algorithm uses linear number of space. We also extend the algorithm to capture repeated keys such that the repetition of the key is at most constant.