
Analytical Estimation of the Scalability of Iterative Numerical Algorithms on Distributed Memory Multiprocessors
This article presents a new highlevel parallel computational model name...
read it

Scalability Evaluation of Iterative Algorithms Used for Supercomputer Simulation of Physical processes
The paper is devoted to the development of a methodology for evaluating ...
read it

BSFskeleton: A Template for Parallelization of Iterative Numerical Algorithms on Cluster Computing Systems
This article describes a method for creating applications for cluster co...
read it

Verification of BSF Parallel Computational Model
The article is devoted to the verification of the BSF parallel computing...
read it

Scalable parallel algorithm for solving nonstationary systems of linear inequalities
In this paper, a scalable iterative projectiontype algorithm for solvin...
read it

A Survey of SemanticsAware Performance Optimization for DataIntensive Computing
We are living in the era of Big Data and witnessing the explosion of dat...
read it

A Noniterative Parallelizable Eigenbasis Algorithm for Johnson Graphs
We present a new O(k^2 nk^2) method for generating an orthogonal basis o...
read it
BSF: a parallel computation model for scalability estimation of iterative numerical algorithms on cluster computing systems
This paper examines a new parallel computation model called bulk synchronous farm (BSF) that focuses on estimating the scalability of computeintensive iterative algorithms aimed at cluster computing systems. In the BSF model, a computer is a set of processor nodes connected by a network and organized according to the master/slave paradigm. A cost metric of the BSF model is presented. This cost metric requires the algorithm to be represented in the form of operations on lists. This allows us to derive an equation that predicts the scalability boundary of a parallel program: the maximum number of processor nodes after which the speedup begins to decrease. The paper includes several examples of applying the BSF model to designing and analyzing parallel numerical algorithms. The largescale computational experiments conducted on a cluster computing system confirm the adequacy of the analytical estimations obtained using the BSF model.
READ FULL TEXT
Comments
There are no comments yet.