Analytical estimation of the scalability of iterative numerical algorithms on distributed memory multiprocessors

From MaRDI portal
Publication:1662783

DOI10.1134/S1995080218040121zbMATH Open1398.65378arXiv1710.10490WikidataQ129778248 ScholiaQ129778248MaRDI QIDQ1662783FDOQ1662783


Authors: Y. Aharonov Edit this on Wikidata


Publication date: 20 August 2018

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1710.10490




Recommendations




Cites Work


Cited In (3)

Uses Software





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)