Abstract
This book explains how to use the bulk synchronous parallel (BSP) model to design and implement parallel algorithms in the areas of scientific computing and big data. Furthermore, it presents a hybrid BSP approach towards new hardware developments such as hierarchical architectures with both shared and distributed memory. The book provides a full treatment of core problems in scientific computing and big data, starting from a high-level problem description, via a sequential solution algorithm to a parallel solution algorithm and an actual parallel program written in the communication library BSPlib. Numerical experiments are presented for parallel programs on modern parallel computers ranging from desktop computers to massively parallel supercomputers. The introductory chapter of the book gives a complete overview of BSPlib, so that the reader already at an early stage is able to write his/her own parallel programs. Furthermore, it treats BSP benchmarking and parallel sorting by regular sampling. The next three chapters treat basic numerical linear algebra problems such as linear system solving by LU decomposition, sparse matrix-vector multiplication (SpMV), and the fast Fourier transform (FFT). The final chapter explores parallel algorithms for big data problems such as graph matching. The book is accompanied by a software package BSPedupack, freely available online from the author’s homepage, which contains all programs of the book and a set of test programs.
Original language | English |
---|---|
Place of Publication | Oxford, UK |
Publisher | Oxford University Press |
Number of pages | 416 |
Edition | Second |
ISBN (Electronic) | 9780191092572 |
ISBN (Print) | 9780198788348 |
DOIs | |
Publication status | Published - 30 Sept 2020 |
Keywords
- bulk synchronous parallel
- parallel algorithm
- parallel programming
- scientific computing
- big data
- supercomputer
- graph algorithm,
- linear system solving