.png){kind=icon}
Return
Integer merging on EREW PRAM
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-010-0124-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Parallel algorithms
Optimal algorithms
Integer merging
EREW PRAM
Journal
C
IF:
2.8
Papers:
2.3K
Citations:
3.5K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveA charge-modulated FET for detection of biomolecular processes: conception, modeling, and simulation
PREAI
ShareSaveShareSave
ShareSave no more
no more