Optimal Parallel Merging by Counting

Authors:
Hazem M. Bahig;Hatem M. Bahig
Affiliations:
Ain Shams University, Cairo, Egypt;Ain Shams University, Cairo, Egypt
Venue:
ITNG '07 Proceedings of the International Conference on Information Technology
Year:
2007

Citing 0
Cited 1

Merging on PRAM

International Journal of Computers and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new optimal deterministic parallel algorithm for merging two sorted arrays A = (a0, a1, · · · , an1-1) and B = (b0, b1, · · · , bn2-1) of integers. The elements of two sorted arrays are drawn from a domain of integers [0, n - 1], where n = Max(n1, n2). The algorithm takes O(log n) time and O(n) space using n/ log n processors on EREW PRAM. Also, the algorithm is stable.