Merging on PRAM
Bahig, Hazem M.; Bahig, Hatem M.;
Abstract
Many data sets to be merged consist of (1) n distinct keys and (2) the keys are serial numbers. Merging such data can be represented as merging two sorted arrays A = (a , a , . . . , a ) and B = (b , b , . . . , b ) of records such that (1) the keys are distinct; (2) 0≤ a · key, b ·
Other data
Title | Merging on PRAM | Authors | Bahig, Hazem M.; Bahig, Hatem M. | Keywords | EREW PRAM | Integer merging | Merging records | Optimal algorithm | Parallel algorithms | Issue Date | 1-Jan-2008 | Publisher | Acta Press | Journal | International Journal of Computers and Applications | ISSN | 1206212X | DOI | 10.1080/1206212X.2008.11441877 | Scopus ID | 2-s2.0-41349107835 |
Recommend this item
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.