A Randomized Sorting Algorithm on the BSP model

We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimality. Tighter probabilistic bounds are also established. It uses sample sorting and utilizes recently introduced search algorithms for a class of data structures on the BSP model. Moreover, our methods are within a 1 + o1 multiplicative factor of the respective sequential methods in terms of speedup for a wide range of the BSP parameters.

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Alexandros V. Gerbessiotis, Constantinos J. Siniolakis
• Keywords: Algorithms, Distributed And Parallel Computing, IPPS 1997, Randomized Sorting Algorithm, Tighter Probabilistic Bounds