Parallel algorithms for selection on the BSP and BSP* models

Abstract

AbstractIn this paper, we propose parallel algorithms to solve the selection problem on the Bulk‐Synchronous Parallel (BSP) model and the BSP* model. The BSP and BSP* models are recently proposed parallel computation models. They can represent the communication cost, a vital element in the latest parallel computations, in terms of the parameters of the synchronization period L, the reciprocal g of the communication network bandwidth, and the packet size it B. In this paper, we propose a parallel algorithm having an internal computation time O[(n/p) + dlogploglogn + L(logploglogn)/(logd)] and a communication time O[g(n/p) + (gd + L)(logploglogn)/(logd)], on the BSP model, and a parallel algorithm having an internal computation time O[(n/p) + dlogploglogn + L(logploglogn)/(logd)] and a communication time O[g(n/(pB)) + (n/p)1/7(logp)6/7) + (gd + L)(logploglogn)/(logd)] on the BSP* model for any integer d(1 ≤ d ≤ logn) to solve the problem of selecting n data with p processors. © 2002 Wiley Periodicals, Inc. Syst Comp Jpn, 33(12): 97–107, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1170