Analytical Estimation of the Scalability of Iterative Numerical Algorithms on Distributed Memory Multiprocessors


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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


版权所有 © Pleiades Publishing, Ltd., 2018
##common.cookie##