Analytical estimation of the scalability of iterative numerical algorithms on distributed memory multiprocessors
From MaRDI portal
(Redirected from Publication:1662783)
Abstract: This article presents a new high-level parallel computational model named BSF - Bulk Synchronous Farm. The BSF model extends the BSP model to deal with the compute-intensive iterative numerical methods executed on distributed-memory multiprocessor systems. The BSF model is based on the master-worker paradigm and the SPMD programming model. The BSF model makes it possible to predict the upper scalability bound of a BSF-program with great accuracy. The BSF model also provides equations for estimating the speedup and parallel efficiency of a BSF-program.
Recommendations
Cites work
- scientific article; zbMATH DE number 1728439 (Why is no real title available?)
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- $\log_{\rm n}{\rm P}$ and $\log_{3}{\rm P}$: Accurate Analytical Models of Point-to-Point Communication in Distributed Systems
- A bridging model for multi-core computing
- A single-program-multiple-data computational model for EPEX/FORTRAN
- A survey of the iterative methods for the solution of linear systems by extrapolation, relaxation and other techniques
- H-BSP
- H-BSP: Hierarchical BSP computation model
- The master-slave paradigm in parallel computer and industrial settings
Cited in
(3)
This page was built for publication: Analytical estimation of the scalability of iterative numerical algorithms on distributed memory multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662783)