Name
Abstract | ||
|---|---|---|
We present an optimal parallel selection algorithm on the EREW PRAM. This algorithm runs in O(log n) time with n/log n processors. This complexity matches the known lower bound for parallel selection on the EREW PRAM model. We therefore close this problem which has been open for more than a decade. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1145/644108.644110 | Symposium on Discrete Algorithms |
Keywords | Field | DocType |
optimal parallel selection algorithm,n processor,erew pram,log n,erew pram model,selection,parallel algorithms,parallel selection,parallel algorithm,lower bound | Binary logarithm,Computer science,Upper and lower bounds,Parallel algorithm,Selection algorithm,Parallel computing | Conference |
ISBN | Citations | PageRank |
0-89871-538-5 | 3 | 0.47 |
References | Authors | |
18 | 1 | |