Loading…

Organization of parallel-pipeline calculations for modeling the pollutant distribution process in a reservoir

One of the most acute problems for today is the water pollution. For rapid decision in emergency situations, it is necessary to develop effective software and algorithmic tools that allow us to make accurate forecasts of the environmental situation changing of coastal systems. Water pollution of the...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2021-12, Vol.2131 (3), p.32050
Main Authors: Litvinov, V N, Gracheva, N N, Filina, A A, Nikitina, A V
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:One of the most acute problems for today is the water pollution. For rapid decision in emergency situations, it is necessary to develop effective software and algorithmic tools that allow us to make accurate forecasts of the environmental situation changing of coastal systems. Water pollution of the Azov and Black Seas by storm drains and human waste products leads to an increase of toxic substances concentrations that significantly exceed the maximum permissible values. The pollution transport problem is solved on the basis of the Navier-Stokes and the diffusion-convection-reaction equations. As a result of discretization of the continuous problem of transport of pollutants using the finite-difference approach for a rectangular grid, we obtain a system of linear algebraic equations (SLAE) of large dimension, which require significant time costs. To increase the efficiency of calculations (to reduce the time) on a multiprocessor computer system (MCS), there is a need to develop effective parallel algorithms for solving SLAE. The decomposition method for a two-dimensional computational domain is proposed in this paper, which allows organizing a parallel-pipeline process of calculations as follows: at each stage of calculations, each processor core simultaneously processes fragments of the computational domain that are offset from each other. This process is described in the form of a graph, in which each node corresponds to fragments of the computational domain, and the edges – a sign of the adjacency of fragments.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/2131/3/032050