Merging data records on EREW PRAM
Bahig, Hazem;
Abstract
Given two sorted arrays A = (a , a , ... , a ) and B = (b , b , ... , b ) 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(log n) time on EREW PRAM to merge two sorted arrays of records using 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. © Springer-Verlag Berlin Heidelberg 2010. 1 1 n 1 2 n
Other data
| Title | Merging data records on EREW PRAM | Authors | Bahig, Hazem | Keywords | Erew pram;Integer merging;Merging records;Parallel algorithms | Issue Date | 1-Dec-2010 | Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Start page | 391 | End page | 400 | ISBN | 3642131352 | ISSN | 03029743 | DOI | 10.1007/978-3-642-13136-3_40 | Scopus ID | 2-s2.0-79956280976 |
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.