The approach to increasing the efficiency of convolution algorithms in modern high-availability systems

Most modern high-availability information systems are either based on systems that are classified as artificial intelligence, or to a large extent include them as components. The solution of many problems of artificial intelligence is based on the use of algorithms that implement the convolution operation (for example, algorithms for training neural networks). The article proposes an approach that, on the one hand, provides a strict formalization of this operation based on the algebra of multidimensional matrices, and on the other hand, due to this, it provides such practical advantages as simplifying and reducing the cost of developing such information systems, as well as reducing the execution time of queries to them. due to the simplicity of the development of parallel algorithms and programs and the efficient use of parallel computing systems. Convolution is an indispensable operation for solving many scientific and technical problems, such as machine learning, data analysis, signal processing, image processing filters. An important role is played by multidimensional convolutions, which are widely used in various subject areas. At the same time, due to the complexity of the algorithms that implement them, in practice even three-dimensional convolutions are used much less frequently than one- and two-dimensional ones. Replacing a multidimensional convolution operation with a sequence of convolution operations of lower dimensions significantly increases its computational complexity. The main reason for this lies in the absence of a unified strict definition of the operation and overload in mathematics of the term «convolution». Therefore, the article discusses a multidimensional-matrix computation model, which allows one to effectively formalize problems whose solution uses multidimensional convolution operations, and to implement an effective solution to these problems due to the natural parallelism inherent in the operations of the algebra of multidimensional matrices.