Parallel Computing and Applications

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Computational and Applied Mathematics".

Deadline for manuscript submissions: closed (1 April 2023) | Viewed by 11301

Special Issue Editors

School of Electronic Engineering and Computer Science, South Ural State University (national research university), 454080 Chelyabinsk, Russia
Interests: artificial neural networks and machine learning; parallel computing; database systems; computational mathematics
IT Department, South Ural State University (National Research University), 664074 Chelyabinsk, Russia
Interests: data mining; parallel algorithms; time series; parallel DBMS
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Currently, parallel computing technologies and high-performance computing are ubiquitous and play a crucial role in data processing. When adapting existing and developing novel data processing methods, researchers and practitioners are faced with issues related to increasing levels of parallelism in computing architectures, software, and algorithms.

This Special Issue aims to publish high-quality, cutting-edge research articles on solutions to challenges in parallel computing and its applications in various domains. The scope of the Special Issue includes (but is not limited to) the parallel and distributed computing technologies on multiprocessor and multicore architectures; application of parallel methods and algorithms in computational mathematics, gas hydrodynamics, and mechanics; parallel algorithms in data mining; parallel methods in machine learning and neural networks, and parallel and distributed database systems.

Prof. Dr. Leonid B. Sokolinsky
Prof. Dr. Mikhail Zymbler
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • models of parallel and distributed computations
  • emerging multiprocessor and multicore architectures
  • models, methods and algorithms for management, administration, monitoring and testing of multiprocessor systems
  • parallel methods and algorithms in computational mathematics, gas hydrodynamics, mechanics, etc
  • parallel algorithms in data mining
  • parallel methods in machine learning and neural networks
  • parallel and distributed database systems

Published Papers (10 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

16 pages, 641 KiB  
Article
One Approach to Numerical Modeling of the Heat and Mass Transfers of Two-Phase Fluids in Fractured-Porous Reservoirs
by Yuliya O. Bobreneva, Yury Poveshchenko, Viktoriia O. Podryga, Sergey V. Polyakov, Ravil M. Uzyanbaev, Parvin I. Rahimly, Ainur A. Mazitov and Irek M. Gubaydullin
Mathematics 2023, 11(18), 3991; https://0-doi-org.brum.beds.ac.uk/10.3390/math11183991 - 20 Sep 2023
Viewed by 555
Abstract
The work is devoted to numerical modeling of the processes of heat and mass transfer of a two-phase fluid in the environment of a production well, which is necessary for monitoring the development of fractured-porous reservoirs. This work proposes an efficient approach to [...] Read more.
The work is devoted to numerical modeling of the processes of heat and mass transfer of a two-phase fluid in the environment of a production well, which is necessary for monitoring the development of fractured-porous reservoirs. This work proposes an efficient approach to constructing a solution to the problem. To solve the problem, a model of the “double medium” type is used, where the pore part of the reservoir is considered as the first medium, and the system of natural fractures is considered as the second medium. For the resulting mathematical model, the difference schemes with time weights are constructed based on the algorithm of splitting by physical processes, which ensure the correctness and consistency of fluxes in the fracture system and the pore reservoir. In the numerical solution, the approximations of differential operators obtained in the framework of the finite difference method are used. For the parallel implementation of the developed numerical approach, the domain decomposition method and the matrix sweep algorithm are chosen. The program implementation is made using the MPI standard. Computational experiments are carried out, the results of which confirm the effectiveness of the developed numerical algorithm and its parallel implementation. In numerical experiments, the distributions of pressure and temperature near an operating production well are obtained, on the basis of which it is possible to adjust the operation of wells in order to increase production. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Graphical abstract

26 pages, 2251 KiB  
Article
High-Performance Time Series Anomaly Discovery on Graphics Processors
by Mikhail Zymbler and Yana Kraeva
Mathematics 2023, 11(14), 3193; https://0-doi-org.brum.beds.ac.uk/10.3390/math11143193 - 20 Jul 2023
Cited by 1 | Viewed by 846
Abstract
Currently, discovering subsequence anomalies in time series remains one of the most topical research problems. A subsequence anomaly refers to successive points in time that are collectively abnormal, although each point is not necessarily an outlier. Among numerous approaches to discovering subsequence anomalies, [...] Read more.
Currently, discovering subsequence anomalies in time series remains one of the most topical research problems. A subsequence anomaly refers to successive points in time that are collectively abnormal, although each point is not necessarily an outlier. Among numerous approaches to discovering subsequence anomalies, the discord concept is considered one of the best. A time series discord is intuitively defined as a subsequence of a given length that is maximally far away from its non-overlapping nearest neighbor. Recently introduced, the MERLIN algorithm discovers time series discords of every possible length in a specified range, thereby eliminating the need to set even that sole parameter to discover discords in a time series. However, MERLIN is serial, and its parallelization could increase the performance of discord discovery. In this article, we introduce a novel parallelization scheme for GPUs called PALMAD, parallel arbitrary length MERLIN-based anomaly discovery. As opposed to its serial predecessor, PALMAD employs recurrent formulas we have derived to avoid redundant calculations, and advanced data structures for the efficient implementation of parallel processing. Experimental evaluation over real-world and synthetic time series shows that our algorithm outperforms parallel analogs. We also apply PALMAD to discover anomalies in a real-world time series, employing our proposed discord heatmap technique to illustrate the results. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Figure 1

16 pages, 3895 KiB  
Article
Multiobjective Optimization of a Metal Complex Catalytic Reaction Based on a Detailed Kinetic Model with Parallelization of Calculations
by Sergey Koledin, Kamila Koledina and Irek Gubaydullin
Mathematics 2023, 11(9), 2051; https://0-doi-org.brum.beds.ac.uk/10.3390/math11092051 - 26 Apr 2023
Viewed by 661
Abstract
The solution of the multiobjective optimization problem was performed with the help of the Pareto approximation algorithm. The problem of multiobjective optimization of the reaction process conditions for the olefin hydroalumination catalytic reaction, with the presence of organoaluminum compounds diisobutylaluminiumchloride, diisobutylaluminiumhydrate, and triisobutylaluminum, [...] Read more.
The solution of the multiobjective optimization problem was performed with the help of the Pareto approximation algorithm. The problem of multiobjective optimization of the reaction process conditions for the olefin hydroalumination catalytic reaction, with the presence of organoaluminum compounds diisobutylaluminiumchloride, diisobutylaluminiumhydrate, and triisobutylaluminum, was solved. The optimality criteria are the yield of the reaction resultants. The largest yield of the high-order organoaluminum compound Bu2AlR was observed for the reactions with diisobutylaluminiumhydrate and triisobutylaluminum. Such results were obtained due to the fact that in the case of diisobutylaluminiumchloride, Bu2AlR was used for the formation of ClBuAlR. The yield of the Schwartz reagent Cp2ZrHCl was higher by a third in the reaction in the presence of diisobutylaluminiumchloride. Unlike the experimental isothermal conditions, the temperature optimal control showed the sufficiency of the gradual growth temperature for achieving the same or higher values of optimality criteria. For computational experiments, the algorithm for solving the multi-criteria optimization problem was parallelized using an island model. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Figure 1

28 pages, 470 KiB  
Article
Apex Method: A New Scalable Iterative Method for Linear Programming
by Leonid B. Sokolinsky and Irina M. Sokolinskaya
Mathematics 2023, 11(7), 1654; https://0-doi-org.brum.beds.ac.uk/10.3390/math11071654 - 29 Mar 2023
Viewed by 945
Abstract
The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to the exact [...] Read more.
The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to the exact solution of a linear programming problem. The optimal path refers to a path of the minimum length according to the Euclidean metric. The apex method is based on the predictor—corrector framework and proceeds in two stages: quest (predictor) and target (corrector). The quest stage calculates a rough initial approximation of the linear programming problem. The target stage refines the initial approximation with a given precision. The main operation used in the apex method is an operation that calculates the pseudoprojection, which is a generalization of the metric projection to a convex closed set. This operation is used both in the quest stage and in the target stage. A parallel algorithm using a Fejér mapping to compute the pseudoprojection is presented. An analytical estimation of the parallelism degree of this algorithm is obtained. AlsoAdditionally, an algorithm implementing the target stage is given. The convergence of this algorithm is proven. An experimental study of the scalability of the apex method on a cluster computing system is described. The results of applying the apex method to solve problems from the Netlib-LP repository are presented. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Figure 1

15 pages, 696 KiB  
Article
Computer Simulation of Coke Sediments Burning from the Whole Cylindrical Catalyst Grain
by Olga S. Yazovtseva, Irek M. Gubaydullin, Elizaveta E. Peskova, Lev A. Sukharev and Andrey N. Zagoruiko
Mathematics 2023, 11(3), 669; https://0-doi-org.brum.beds.ac.uk/10.3390/math11030669 - 28 Jan 2023
Cited by 1 | Viewed by 1015
Abstract
The article is devoted to the development of the mathematical model of oxidative regeneration of the cylindrical catalyst grain. The model is constructed using a diffusion approach to modeling catalytic processes. The model is based on the equations of material and thermal balance. [...] Read more.
The article is devoted to the development of the mathematical model of oxidative regeneration of the cylindrical catalyst grain. The model is constructed using a diffusion approach to modeling catalytic processes. The model is based on the equations of material and thermal balance. Mass transfer in the catalyst grain is carried out due to diffusion and the Stefan flow resulting from a decrease in the reaction volume during sorption processes. Chemical transformations of substances are taken into account as a source term in the equation. The thermal balance of the catalyst grain is described by a thermal conductivity equation, with an inhomogeneous term responsible for heating the grain during exothermic chemical reactions. The effective coefficients of heat capacity and thermal conductivity of the catalyst grain, which are determined taking into account the porosity of the grain depending on temperature, were used to calculate the thermal balance of the catalyst grain. The dependencies are approximated using the method of least squares based on experimental data. Different boundary conditions for the developed model allow calculating the main characteristics of the oxidative regeneration process for a whole catalyst grain under different conditions. The mathematical model of oxidative regeneration of a cylindrical catalyst grain is described by a stiff system of differential equations. Splitting by physical processes is applied to avoid computational difficulties. The calculation of flows is carried out sequentially: first, chemical problems are solved using the Radau method, then the diffusion and thermal conductivity equations are solved by the finite volume method. The result of the algorithm implemented in C++ is a picture of the distribution of substances and temperature along the cylindrical grain of the catalyst. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Figure 1

9 pages, 705 KiB  
Article
Energy Efficiency of a New Parallel PIC Code for Numerical Simulation of Plasma Dynamics in Open Trap
by Igor Chernykh, Igor Kulikov, Vitaly Vshivkov, Ekaterina Genrikh, Dmitry Weins, Galina Dudnikova, Ivan Chernoshtanov and Marina Boronina
Mathematics 2022, 10(19), 3684; https://doi.org/10.3390/math10193684 - 08 Oct 2022
Cited by 1 | Viewed by 1087
Abstract
The generation of energy-efficient parallel scientific codes became very important in the time of carbon footprint reduction. In this paper, we briefly present our latest particle-in-cell code with the results of a numerical simulation of plasma dynamics in an open trap. This code [...] Read more.
The generation of energy-efficient parallel scientific codes became very important in the time of carbon footprint reduction. In this paper, we briefly present our latest particle-in-cell code with the results of a numerical simulation of plasma dynamics in an open trap. This code can be auto-vectorized by the Fortran compiler for Intel Xeon processors with AVX-512 instructions such as Intel Xeon Phi and the highest series of all generations of Intel Xeon Scalable processors. Efficient use of processor architecture is the main feature of an energy-efficient solution. We present a step-by-step methodology of energy consumption calculation using Intel hardware features and Intel VTune software. We also give an estimated value of carbon footprint with the impact of high-performance water cooled hardware. The Power Usage Effectiveness (PUE) in the case of high-performance water cooled hardware is equal to 1.03–1.05, and is up to 1.3 in the case of air-cooled systems. This means that power consumption of liquid cooled systems is lower than that air-cooled ones by up to 25%. All these factors play an important role in the carbon footprint reduction problem. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Figure 1

13 pages, 905 KiB  
Article
On Solving the Problem of Finding Kinetic Parameters of Catalytic Isomerization of the Pentane-Hexane Fraction Using a Parallel Global Search Algorithm
by Konstantin Barkalov, Irek Gubaydullin, Evgeny Kozinov, Ilya Lebedev, Roza Faskhutdinova, Azamat Faskhutdinov and Leniza Enikeeva
Mathematics 2022, 10(19), 3665; https://0-doi-org.brum.beds.ac.uk/10.3390/math10193665 - 06 Oct 2022
Cited by 4 | Viewed by 1106
Abstract
This article is devoted to the problem of developing a kinetic model of a complex chemical reaction using a parallel optimization method. The design of the kinetic model consists of finding the kinetic parameters of the reaction, which cannot be calculated analytically, and [...] Read more.
This article is devoted to the problem of developing a kinetic model of a complex chemical reaction using a parallel optimization method. The design of the kinetic model consists of finding the kinetic parameters of the reaction, which cannot be calculated analytically, and since the chemical reaction involves many stages, the optimization problem is multiextremal. As a chemical reaction, the process of catalytic isomerization of the pentane-hexane fraction is considered, which is now important due to the switch of the oil refining industry to the production of gasoline corresponding to the Euro-5 standard. On the basis of known industrial data on the concentrations of reaction components and the temperature at the outlet of the third reactor, the activation energies and pre-exponential factors of each reaction stage were calculated. To solve the optimization problem, the authors developed a parallel global search algorithm and a program based on Lipschitz optimization. The kinetic parameters found made it possible to develop a mathematical model of the process, which is in good agreement with industrial data. The developed mathematical model in future works will make it possible to study the dynamics of the gas–liquid flow in the reactor unit, taking into account diffusion and heat exchange processes through the catalyst layer. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Figure 1

14 pages, 1671 KiB  
Article
Studying the Efficiency of Parallelization in Optimal Control of Multistage Chemical Reactions
by Maxim Sakharov, Kamila Koledina, Irek Gubaydullin and Anatoly Karpenko
Mathematics 2022, 10(19), 3589; https://0-doi-org.brum.beds.ac.uk/10.3390/math10193589 - 01 Oct 2022
Cited by 2 | Viewed by 1034
Abstract
In this paper, we investigate the problem of optimal control of complex multistage chemical reactions, which is considered a nonlinear global constrained optimization problem. This class of problems is computationally expensive due to the inclusion of multiple parameters and requires parallel computing systems [...] Read more.
In this paper, we investigate the problem of optimal control of complex multistage chemical reactions, which is considered a nonlinear global constrained optimization problem. This class of problems is computationally expensive due to the inclusion of multiple parameters and requires parallel computing systems and algorithms to obtain a solution within a reasonable time. However, the efficiency of parallel algorithms can differ depending on the architecture of the computing system. One available approach to deal with this is the development of specialized optimization algorithms that consider not only problem-specific features but also peculiarities of a computing system in which the algorithms are launched. In this work, we developed a novel parallel population algorithm based on the mind evolutionary computation method. This algorithm is designed for desktop girds and works in synchronous and asynchronous modes. The algorithm and its software implementation were used to solve the problem of the catalytic reforming of gasoline and to study the parallelization efficiency. Results of the numerical experiments are presented in this paper. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Graphical abstract

12 pages, 1097 KiB  
Article
OMPEGAS: Optimized Relativistic Code for Multicore Architecture
by Elena N. Akimova, Vladimir E. Misilov, Igor M. Kulikov and Igor G. Chernykh
Mathematics 2022, 10(14), 2546; https://0-doi-org.brum.beds.ac.uk/10.3390/math10142546 - 21 Jul 2022
Cited by 2 | Viewed by 1190
Abstract
The paper presents a new hydrodynamical code, OMPEGAS, for the 3D simulation of astrophysical flows on shared memory architectures. It provides a numerical method for solving the three-dimensional equations of the gravitational hydrodynamics based on Godunov’s method for solving the Riemann problem and [...] Read more.
The paper presents a new hydrodynamical code, OMPEGAS, for the 3D simulation of astrophysical flows on shared memory architectures. It provides a numerical method for solving the three-dimensional equations of the gravitational hydrodynamics based on Godunov’s method for solving the Riemann problem and the piecewise parabolic approximation with a local stencil. It obtains a high order of accuracy and low dissipation of the solution. The code is implemented for multicore processors with vector instructions using the OpenMP technology, Intel SDLT library, and compiler auto-vectorization tools. The model problem of simulating a star explosion was used to study the developed code. The experiments show that the presented code reproduces the behavior of the explosion correctly. Experiments for the model problem with a grid size of 128×128×128 were performed on an 16-core Intel Core i9-12900K CPU to study the efficiency and performance of the developed code. By using the autovectorization, we achieved a 3.3-fold increase in speed in comparison with the non-vectorized program on the processor with AVX2 support. By using multithreading with OpenMP, we achieved an increase in speed of 2.6 times on a 16-core processor in comparison with the vectorized single-threaded program. The total increase in speed was up to ninefold. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Figure 1

19 pages, 7457 KiB  
Article
A New Parallel Code Based on a Simple Piecewise Parabolic Method for Numerical Modeling of Colliding Flows in Relativistic Hydrodynamics
by Igor Kulikov, Igor Chernykh, Dmitry Karavaev, Vladimir Prigarin, Anna Sapetina, Ivan Ulyanichev and Oleg Zavyalov
Mathematics 2022, 10(11), 1865; https://0-doi-org.brum.beds.ac.uk/10.3390/math10111865 - 30 May 2022
Cited by 4 | Viewed by 1368
Abstract
A new parallel code based on models of special relativistic hydrodynamics is presented for describing interacting flows. A new highly accurate numerical method is considered and verified. A parallel implementation of the method by means of Coarray Fortran technology and its efficiency are [...] Read more.
A new parallel code based on models of special relativistic hydrodynamics is presented for describing interacting flows. A new highly accurate numerical method is considered and verified. A parallel implementation of the method by means of Coarray Fortran technology and its efficiency are described in detail. The code scalability is 92% on a cluster with Intel Xeon 6248R NKS-1P with 192 Coarray Fortran images. Different interacting relativistic flows are considered as astrophysical applications. Full article
(This article belongs to the Special Issue Parallel Computing and Applications)
Show Figures

Figure 1

Back to TopTop