Abstract

The implementation of data structures on distributed memory models such as the Bulk-Synchronous Parallel (BSP) model, rather than shared memory ones such as the Parallel Random Access Machine (PRAM), offers a serious challenge. In this work we undertake the architecture independent study of the computation and communication requirements of searching ordered h-level graphs, which include many of the standard data structures. We propose multi-way search as a general tool for the design, analysis and implementation of BSP algorithms. This technique allows elegant high-level design and analysis of algorithms, using data structures similar to those of sequential models. Applications to computational geometry and sorting are also presented. In particular, our new randomized sorting algorithm improves previously known BSP randomized sorting algorithms upon the amount of parallel slackness required to achieve optimality. Moreover, our methods are within a 1 + o(1) multiplicative factor of the ...

Citations