Abstract
We present a new randomized sorting algorithm on the Bulk-Synchronous Parallel (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+o(1) multiplicative factor of the respective sequential methods in terms of speedup for a wide range of the BSP parameters.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 293-297 |
| Number of pages | 5 |
| Journal | Proceedings of the International Parallel Processing Symposium, IPPS |
| State | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 11th International Parallel Processing Symposium, IPPS 97 - Geneva, Switz Duration: Apr 1 1997 → Apr 5 1997 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture