Paper Info
Title
Optimal Parallel Merging by Counting
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.
Year
DOI
Venue
2007
10.1109/ITNG.2007.144
ITNG
Keywords
Field
DocType
n processor,erew pram,optimal deterministic parallel algorithm,optimal parallel merging,log n,algorithm design and analysis,computational complexity,computer science,merging,application software,parallel algorithms,parallel algorithm,sorting,mathematics
Integer,Binary logarithm,Combinatorics,Algorithm design,Parallel algorithm,Computer science,Parallel computing,Sorting,Merge (version control),Computational complexity theory
Conference
ISBN
Citations 
PageRank 
0-7695-2776-0
0
0.34
References 
Authors
7
2
Name
Order
Citations
PageRank
Hazem M. Bahig1247.61
Hatem M. Bahig2237.53