BSPlib: The BSP programming library
Jonathan M. D. Hill, Bill McColl, Dan C. Stefanescu et al. · Parallel Computing · 1998
BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full definition of BSPlib in C, motivates the design of its basic operations, and gives examples of their use. The library enables programming in two distinct styles: direct remote memory access (DRMA) using put or get operations, and bulk synchronous message passing (BSMP). Currently, implementations of BSPlib exist for a variety of modern architectures, including massively parallel computers with distributed memory, shared memory multiprocessors, and networks of workstations. BSPlib has been used in several scientific and industrial applications; this paper briefly describes applications in benchmarking, Fast Fourier Transforms (FFTs), sorting, and molecular dynamics.
Cited by 324 works. doi:10.1016/s0167-8191(98)00093-3 Open-access PDF
Authors
- Jonathan M. D. Hill
- Bill McColl
- Dan C. Stefanescu
- Mark W. Goudreau
- Satish B. Rao
- Torsten Suel
- Thanasis Tsantilas
- Rob H. Bisseling
References
- A fast algorithm for particle simulations
- Using MPI: Portable parallel programming with the message-passing interface
- A Bridging Model for Parallel Computation
- A hierarchical O(N log N) force-calculation algorithm
- An Efficient Program for Many-Body Simulation
- Computational Frameworks for the Fast Fourier Transform
- LogP: towards a realistic model of parallel computation
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- Quicksort
- A comparison of sorting algorithms for the connection machine CM-2