Title :
Optimal Parallel Merging by Counting
Author :
Bahig, Hazem M. ; Bahig, Hatem M.
Author_Institution :
Comput. Sci. Div., Ain Shams Univ., Cairo
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
Keywords :
computational complexity; deterministic algorithms; merging; parallel algorithms; optimal deterministic parallel algorithm; optimal parallel merging; Algorithm design and analysis; Application software; Computer science; Mathematics; Merging; Parallel algorithms; Phase change random access memory; Read-write memory; Sorting; Spatial databases;
Conference_Titel :
Information Technology, 2007. ITNG '07. Fourth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
0-7695-2776-0
DOI :
10.1109/ITNG.2007.144
