By Topic

Efficient parallel binary search on sorted arrays, with applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
D. Z. Chen ; Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA

Let A be a sorted array of n numbers and B a sorted array of m numbers, both in nondecreasing order, with n⩽m. We consider the problem of determining, for each element A(j), j=1, 2, …, n, the unique element B(i), 0⩽i⩽m, such that B(i)⩽A(j)<B(i+1) (with B(0)=-∞ and B(m+1)=+∞). We present an efficient parallel algorithm for solving this problem in O(log m) time using O([nlog (m/n)]/[log m]) EREW PRAM processors. Our algorithm improves the previously known results on either the time or processor complexity, and enables us to solve several other problems optimally on the EREW PRAM

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:6 ,  Issue: 4 )