Vitaly Egunov

Mr. Vitaly Egunov

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 October 2022 in Energies
Verified
Journal Article
Open access
PDF file
Alla G. KravetsAlla G. Kravets
Alla G. Kravets
VEVitaly Egunov
Vitaly Egunov
Reducing the consumption of electricity by computing devices is currently an urgent task. Moreover, if earlier this problem belonged to the competence of hardware developers and the design of more cost-effective equipment, then more recently there has been an increased interest in this issue on the part of software developers. The issues of these studies are extensive. From energy efficiency issues of various programming languages to the development of energy-saving software for smartphones and other gadgets. However, to the best of our knowledge, no study has reported an analysis of the impact of cache optimizations on computing devices’ power consumption. Hence, this paper aims to provide an analysis of such impact on the software energy efficiency using the original software design procedure and computational experiments. The proposed Software Cache Optimization (SCO)-based Methodology was applied to one of the key linear algebra transformations. Experiments were carried out to determine software energy efficiency. RAPL (Running Average Power Limit) was used—an interface developed by Intel, which provides built-in counters of Central Processing Unit (CPU) energy consumption. Measurements have shown that optimized software versions reduce power consumption up to 4 times in relation to the basic transformation scheme. Experimental results confirm the effectiveness of the SCO-based Methodology used to reduce energy consumption and the applicability of this technique for software optimization.

19 November 2016 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
BGBoris Glinsky
Boris Glinsky
IKIgor Kulikov
Igor Kulikov
ICIgor Chernykh
Igor Chernykh
DWDmitry Weins
Dmitry Weins
ASAlexey Snytnikov
Alexey Snytnikov
EKEgor Kharkov
Egor Kharkov

1 January 2016
Verified
Conference Paper
Closed access
VEVitaly Egunov
Vitaly Egunov
AAA. Andreev
A. Andreev
The paper presents some results of research of applicability of various computing schemes of implementing QR and LQ matrix decompositions for shared memory parallel systems. Three computational schemes to perform the Hauseholder transformations on shared memory parallel systems are considered: the right multiplication of the source matrix by the reflection matrix (QR decomposition) with column processing source matrix, the right multiplication (QR decomposition) with row processing source matrix, the left multiplication of the source matrix by the reflection matrix (LQ decomposition) with row processing source matrix. The results of numerical experiments estimating the speedup and efficiency of investigated computational schemes, their scalability on shared memory systems are presented, providing guidance on the choice of a particular computational scheme based on the characteristics of the original problem.

17 August 2017
Verified
Book Chapter
Closed access
PDF file
VGVictor Getmanskiy
Victor Getmanskiy
AAAndrey E. Andreev
Andrey E. Andreev
SASergey Alekseev
Sergey Alekseev
AGAlexander S. Gorobtsov
Alexander S. Gorobtsov
VEVitaly Egunov
Vitaly Egunov
EKEgor Kharkov
Egor Kharkov

14 October 2023
Verified
Book Chapter
Closed access
PDF file
Alla G. KravetsAlla G. Kravets
Alla G. Kravets
IPIvan D. Pavlenko
Ivan D. Pavlenko
VEVitaly Egunov
Vitaly Egunov
EKEvgeny Kravets
Evgeny Kravets

27 July 2023 in Programmnaya Ingeneria
Verified
Journal Article
Closed access
VEVitaly Egunov
Vitaly Egunov
Alla G. KravetsAlla G. Kravets
Alla G. Kravets
This paper considers the problem of increasing the software efficiency in terms of reducing the costs of their development and operation in the process of solving production and research tasks. We have analysed the existing approaches to solving this problem by example of parameterized algorithms for implementing mVm (matrix—vector multiplication) and MMM (matrix—matrix multiplication)) BLAS (Basic Linear Algebra Subroutines) operations. To achieve the goal of increasing the software efficiency, we proposed a new design method, designed to improve data caching algorithms in the software development for computing systems with a hierarchical memory structure. Using the proposed design procedure, we developed an analytical approach to evaluating the software effectiveness from the point of view of using a memory subsystem with a hierarchical structure is implemented. We applied the proposed method to the two-sided Householder transformation for the task of reducing the general form matrix to the Hessenberg form. Then we presented new algorithms for solving the problem, which are optimized variants of the Householder classical transformation: Row-Oriented Householder and Single-Pass Householder. The use of these algorithms can significantly reduce the software execution time. Computational experiments were carried out on a parallel computing system with shared memory, which is one of the nodes of the computing cluster of the Volgograd State Technical University. We made a comparison of the software execution time that reduce general-form matrices to Hessenberg form, written using the proposed algorithms and using the LAPACKE_dgehrd() function of the Intel MKL library. The conclusions made in the work are confirmed by the results of the conducted computational experiments.