.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
Given two sorted arrays A = (a1, a2,....., a(n1)) and B = (b1, b2,....,b(n2)) 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 n/logn processors and O(n) storage. We also give the conditions that make the algorithm run in a constant time on a EREW PRAM.
Keyword:
Parallel algorithms
Optimal algorithms
Integer merging
EREW PRAM
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
暂无机构信息
引用论文
.png){kind=icon}
A charge-modulated FET for detection of biomolecular processes: conception, modeling, and simulation.png)
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏
分享收藏 没有更多内容
没有更多内容