Analytical Estimation of the Scalability of Iterative Numerical Algorithms on Distributed Memory Multiprocessors
- Авторы: Sokolinsky L.1
-
Учреждения:
- South Ural State University (National Research University)
- Выпуск: Том 39, № 4 (2018)
- Страницы: 571-575
- Раздел: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/202058
- DOI: https://doi.org/10.1134/S1995080218040121
- ID: 202058
Цитировать
Аннотация
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.
Об авторах
L. Sokolinsky
South Ural State University (National Research University)
Автор, ответственный за переписку.
Email: leonid.sokolinsky@susu.ru
Россия, Lenin prospekt, 76, Chelyabinsk, 454080
![](/img/style/loading.gif)