Email this article Analytical Estimation of the Scalability of Iterative Numerical Algorithms on Distributed Memory Multiprocessors
- Authors: Sokolinsky L.B.1
-
Affiliations:
- South Ural State University (National Research University)
- Issue: Vol 39, No 4 (2018)
- Pages: 571-575
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202058
- DOI: https://doi.org/10.1134/S1995080218040121
- ID: 202058
Cite item
Open Access
Access granted
Subscription Access
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 computeintensive iterative numericalmethods 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.
About the authors
L. B. Sokolinsky
South Ural State University (National Research University)
Author for correspondence.
Email: leonid.sokolinsky@susu.ru
Russian Federation, Lenin prospekt, 76, Chelyabinsk, 454080
