Paper Info
Title
Merging data records on EREW PRAM
Abstract
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.
Year
DOI
Venue
2010
10.1007/978-3-642-13136-3_40
ICA3PP (2)
Keywords
Field
DocType
serial number,n record,merging data record,erew pram,computer science,linear number,data record,parallel algorithms
Discrete mathematics,Computer science,Parallel algorithm,Parallel computing,Theoretical computer science,Merge (version control),Data records
Conference
Volume
ISSN
ISBN
6082
0302-9743
3-642-13135-2
Citations 
PageRank 
References 
0
0.34
19
Authors
1
Name
Order
Citations
PageRank
Hazem M. Bahig1247.61