Affiliation:
1. University of Missouri at Kansas City, Kansas City, MO
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献