activity
20172024
most citedBSF: a parallel computation model for scalability estimation of iterative numerical algorithms on cluster computing systems

28 citations · 89 across the 13 of their papers we have counts for

collaborators

13 papers

math.OC2024

Surface Movement Method for Linear Programming

Nikolay A. Olkhovsky, Leonid B. Sokolinsky

The article presents a new method of linear programming, called the surface movement method. This method constructs an optimal objective path on the surface of the feasible polytop…

math.OC2022★ 4 cited

Visualizing Multidimensional Linear Programming Problems

Nikolay A. Olkhovsky, Leonid B. Sokolinsky

The article proposes an n-dimensional mathematical model of the visual representation of a linear programming problem. This model makes it possible to use artificial neural network…

cs.DC2021★ 4 cited

VaLiPro: Linear Programming Validator for Cluster Computing Systems

Leonid B. Sokolinsky, Irina M. Sokolinskaya

The article presents and evaluates a scalable algorithm for validating solutions of linear programming problems on cluster computing systems. The main idea of the method is to gene…

cs.DC2021★ 2 cited

FRaGenLP: A Generator of Random Linear Programming Problems for Cluster Computing Systems

Leonid B. Sokolinsky, Irina M. Sokolinskaya

The article presents and evaluates a scalable FRaGenLP algorithm for generating random linear programming problems of large dimension on cluster computing systems. To ensure th…

cs.DC2020★ 14 cited

BSF-skeleton: A Template for Parallelization of Iterative Numerical Algorithms on Cluster Computing Systems

Leonid B. Sokolinsky

This article describes a method for creating applications for cluster computing systems using the parallel BSF skeleton based on the original BSF (Bulk Synchronous Farm) model of p…

cs.DC2020★ 28 cited

BSF: a parallel computation model for scalability estimation of iterative numerical algorithms on cluster computing systems

Leonid B. Sokolinsky

This paper examines a new parallel computation model called bulk synchronous farm (BSF) that focuses on estimating the scalability of compute-intensive iterative algorithms aimed a…

math.OC2020★ 7 cited

Scalable Method for Linear Optimization of Industrial Processes

Leonid B. Sokolinsky, Irina M. Sokolinskaya

In the development of industrial digital twins, the optimization problem of technological and business processes often arises. In many cases, this problem can be reduced to a large…

cs.MS2020★ 5 cited

Scalable parallel algorithm for solving non-stationary systems of linear inequalities

Leonid B. Sokolinsky, Irina M. Sokolinskaya

In this paper, a scalable iterative projection-type algorithm for solving non-stationary systems of linear inequalities is considered. A non-stationary system is understood as a la…

cs.DC2018

Scalability Evaluation of Iterative Algorithms Used for Supercomputer Simulation of Physical processes

Nadezhda A. Ezhova, Leonid B. Sokolinsky

The paper is devoted to the development of a methodology for evaluating the scalability of compute-intensive iterative algorithms used in simulating complex physical processes on s…

cs.DC2017★ 13 cited

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

Leonid B. Sokolinsky

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 compute-intensive iterat…

cs.DC2017

Scalability Evaluation of NSLP Algorithm for Solving Non-Stationary Linear Programming Problems on Cluster Computing Systems

Irina Sokolinskaya, Leonid B. Sokolinsky

The paper is devoted to a scalability study of the NSLP algorithm for solving non-stationary high-dimension linear programming problem on the cluster computing systems. The analysi…

cs.DS2017★ 10 cited

On the Solution of Linear Programming Problems in the Age of Big Data

Irina Sokolinskaya, Leonid B. Sokolinsky

The Big Data phenomenon has spawned large-scale linear programming problems. In many cases, these problems are non-stationary. In this paper, we describe a new scalable algorithm c…

cs.DC2017★ 2 cited

Analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory

L. B. Sokolinsky

The paper is devoted to an analytical study of the "master-worker" framework scalability on multiprocessors with distributed memory. A new model of parallel computations called BSF…