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

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-wo...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Lobachevskii journal of mathematics Ročník 39; číslo 4; s. 571 - 575
Hlavný autor: Sokolinsky, L. B.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Moscow Pleiades Publishing 01.05.2018
Springer Nature B.V
Predmet:
Algebra
Analysis
Computer memory
Distributed memory
Geometry
Iterative methods
Mathematical Logic and Foundations
Mathematical models
Mathematics
Mathematics and Statistics
Model accuracy
Multiprocessing
Probability Theory and Stochastic Processes
distributed memory
Parallel computation model
bulk synchronous farm
scalability bound
BSF model
iterative algorithms
ISSN:1995-0802, 1818-9962
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1995-0802
1818-9962
DOI:10.1134/S1995080218040121