A bridging model for parallel computation
Communications of the ACM
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Direct bulk-synchronous parallel algorithms
Journal of Parallel and Distributed Computing
Communication primitive for BSP computers
Information Processing Letters
Bulk synchronous parallel computing
Abstract machine models for highly parallel computers
Towards efficiency and portability: programming with the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
The E-BSP Model: Incorporating General Locality and Unbalanced Communication into the BSP Model
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
On the Distributed Realization of Parallel Algorithms
SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Computational Power of BSP Computers
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Pipelined Decomposable BSP Computers
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Hybrid bulk synchronous parallelism library for clustered smp architectures
Proceedings of the fourth international workshop on High-level parallel programming and applications
| Hi-index | 0.01 |
The Bulk Synchronous Parallel (BSP) computer is a generally accepted realistic model of parallel computers introduced by Valiant in 1990. We present an extension to the BSP model - a decomposable BSP (dBSP for short). Performance of several elementary algorithms, namely broadcasting, prefix computation, and matrix multiplication, is analyzed on BSP and dBSP models. For a suitable setting of parameters, these algorithms run asymptotically faster on dBSP than on BSP. We also show how space-bounded sequential algorithms can be transformed into pipelined ones with bounded period on dBSP. Such a transformation is proved impossible for the BSP model. Finally, we present an algorithm for the simulation of dBSP on BSP.