The implementation of data structures on distributed memory models such as the bulk-synchronous parallel model, rather than shared memory ones such as the parallel random access machine, offers a serious challenge. In this work we undertake the architecture independent study of the computation and communication requirements of searchingordered h-level graphs, which include many of the standard data structures. Our methods are within a 1 +o(1) multiplicative factor of the respective sequential methods. While our methods are fairly simple themselves, description of their performance in terms of the BSP parameters is somewhat complicated. The main reward for quantifying these complications is that it enables software to be written once and for all that can be migrated efficiently among a variety of parallel machines.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence