Name
Abstract | ||
|---|---|---|
Given two sorted arrays $${A=(a_1,a_2,\ldots ,a_{n_1})}$$ and $${B=(b_1,b_2,\ldots ,b_{n_2})}$$, where their elements are drawn from a linear range in n and n = Max(n 1, n 2). The merging of two sorted arrays is one of the fundamental problems in computer science. The main contribution of this work is to give a new merging algorithm on a EREW PRAM. The algorithm is cost optimal, deterministic and simple. The algorithm uses $${\frac{n}{\log{n}}}$$ processors and O(n) storage. We also give the conditions that make the algorithm run in a constant time on a EREW PRAM. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s00607-010-0124-x | Computing |
Keywords | Field | DocType |
Parallel algorithms,Optimal algorithms,Integer merging,EREW PRAM,68W10,68P10 | Integer,Combinatorics,Mathematical analysis,Merge (version control),Mathematics | Journal |
Volume | Issue | ISSN |
91 | 4 | 0010-485X |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hazem M. Bahig | 1 | 24 | 7.61 |