Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Relational Information Systems
Relational Information Systems
Optimal parallel merging and sorting without memory conflicts
IEEE Transactions on Computers
Parallel merging of lists in database management system
Information Systems
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
Optimal merging and sorting on the EREW PRAM
Information Processing Letters
Introduction to algorithms
Parallel algorithms for merging and sorting
Information Sciences: an International Journal
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Information and Computation
An optimal parallel algorithm for merging using multiselection
Information Processing Letters
Parallel computation: models and methods
Parallel computation: models and methods
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Parallel Computing
Parallel Sorting Algorithms
Parallel Double Sort-Merge Algorithm for Object-Oriented Collection Join Queries
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Merging, sorting and matrix operations on the SOME-bus multiprocessor architecture
Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
SIAM Journal on Computing
Recognizing and representing proper interval graphs in parallel using merging and sorting
Discrete Applied Mathematics
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
Parallel merging with restriction
The Journal of Supercomputing
International Journal of Computers and Applications
Parallel database sort and join operations revisited on grids
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
| Hi-index | 0.00 |
Given two sorted arrays A=(a1,a2,⋯,an) and B=(b1,b2, ⋯,bn) of records such that (1) the n records are sorted according to one field which is called the key, and (2) the values of the keys are serial numbers. Merging data records has many applications in computer science especially in database. We develop an algorithm that runs in O(logn) time on EREW PRAM to merge two sorted arrays of records using $\frac{n}{\log{n}}$ processors even the keys of the data records are repeated. The algorithm is cost-optimal, deterministic, stable and uses linear number of space.