Verification of BSF Parallel Computational Model

TL;DR

This paper verifies the BSF parallel computing model, an evolution of master-slave and SPMD models, focusing on iterative algorithms in cluster systems, supported by a C++ simulator and experimental validation.

Contribution

It introduces and verifies the BSF-model for parallel iterative algorithms, providing a cost metric framework and a C++ MPI-based simulator.

Findings

Cost metrics are validated through computational experiments.

The BSF-model effectively describes iterative algorithms in cluster computing.

The C++ simulator demonstrates the model's practical applicability.

Abstract

The article is devoted to the verification of the BSF parallel computing model. The BSF-model is an evolution of the "master-slave" model and SPMD-model. The BSF-model is oriented to iterative algorithms that are implemented in cluster computing systems. The article briefly describes the basics of the BSF-model and its cost metrics. The structure of the BSF program is shown in the form of a UML activity diagram. The simulator of BSF-programs, implemented in C++ language using the MPI-library, is described. The results of computational experiments confirming the adequacy of the cost metrics of the BSF-model are presented.