Bulk Synchronous Parallel (BSP) Paradigm
Jump to navigation
Jump to search
A Bulk Synchronous Parallel (BSP) Paradigm is an bridging model for designing parallel algorithms.
- …
- Counter-Example(s):
- See: Parallel Random Access Machine, Abstract Machine, Bridging Model, Parallel Algorithm.
References
2018
- (Wikipedia, 2018) ⇒ https://en.wikipedia.org/wiki/Bulk_synchronous_parallel Retrieved:2018-3-11.
- The bulk synchronous parallel (BSP) abstract computer is a bridging model for designing parallel algorithms. It serves a purpose similar to the parallel random access machine (PRAM) model. BSP differs from PRAM by not taking communication and synchronization for granted. An important part of analyzing a BSP algorithm rests on quantifying the synchronization and communication needed.
2016
- (Zhang et al., 2016) ⇒ XianXing Zhang, Yitong Zhou, Yiming Ma, Bee-Chung Chen, Liang Zhang, and Deepak Agarwal. (2016). “GLMix: Generalized Linear Mixed Models For Large-Scale Response Prediction.” In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ISBN:978-1-4503-4232-2 doi:10.1145/2939672.2939684
- QUOTE: … However, for big data sets with a large number of ID-level coefficients, fitting a GLMix model can be computationally challenging. In this paper, we report how we successfully overcame the scalability bottleneck by applying parallelized block coordinate descent under the Bulk Synchronous Parallel (BSP) paradigm. …
1990
- (Valiant, 1990) ⇒ Leslie G. Valiant. (1990). “A Bridging Model for Parallel Computation.” Communications of the ACM 33, no. 8
- QUOTE: … The author argues that an analogous bridge between software and hardware in required for parallel computation if that is to become as widely used. This article introduces the bulk-synchronous parallel (BSP) model as a candidate for this role, and gives results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware. ...