Vitaly Egunov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Vitaly Egunov has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Alla Grigorievna Kravets
Volgograd State Technical University
10 shared publications Andrey Andreev
Volgograd State Technical University
3 shared publications- Vladimir Shabalovsky
Computer-Aided Design & Research Design Department, Volgograd State Technical University, Volgograd 400005, Russia
3 shared publications Volgograd State Technical University
3 shared publications- Andrey Andreev
Volgograd State Technical University
2 shared publications - Anna Matokhina
Volgograd State Technical University
2 shared publications
Latest Publications
- Open Access
- 27 August 2026
- Published by MDPI AG in Applied System Innovation
- Vol. 9 (9) , 177
A Hybrid Method for Semantic Cache Analysis of Computational Kernels in C Programs
The performance of modern high-performance computing systems is increasingly constrained not by computational power, but by the efficiency of memory subsystem interaction. Cache behavior optimization thus becomes a critical requirement for developers of computationally intensive applications, including numerical simulations, scientific computing, and machine learning kernels. However, existing analysis tools face fundamental limitations; they either provide only aggregated statistics, or exhibit a “semantic gap” by presenting data in machine addresses rather than source code constructs, which impedes targeted optimization of complex data-intensive programs. This paper introduces CATS (C Annotated Trace-based Cache Simulator), a novel hybrid method and toolset for detailed cache efficiency analysis, designed to overcome these limitations. CATS combines source-level static analysis with dynamic tracing at the intermediate representation (IR) level to generate semantically annotated memory traces, enabling precise identification of which source code data structures (arrays, structs, dynamically allocated objects) cause cache misses. The paper describes the methodology and architecture of CATS and presents a foundational validation of the approach through comparative accuracy analysis against reference simulators (gem5, Valgrind) on regular computational kernels (General Matrix Multiplication, GEMM). Systematic error analysis quantifies CATS’s accuracy bounds across different input sizes for the evaluated cache configuration (L1: 32 KB, L2: 256 KB). The current work explicitly focuses on single-threaded CPU-based C programs; extension to irregular kernels, multi-threaded workloads, hardware accelerators (GPU, FPGA), and specific AI applications are identified as future research. Early CATS application at the design stage enables identification of algorithmic cache bottlenecks before final implementation, complementing traditional compiler-level optimizations.
- 27 August 2026
- Published by MDPI AG in Applied System Innovation
- Vol. 9 (9) , 177
Open AccessA Hybrid Method for Semantic Cache Analysis of Computational Kernels in C Programs
The performance of modern high-performance computing systems is increasingly constrained not by computational power, but by the efficiency of memory subsystem interaction. Cache behavior optimization thus becomes a critical requirement for developers of computationally intensive applications, including numerical simulations, scientific computing, and machine learning kernels. However, existing analysis tools face fundamental limitations; they either provide only aggregated statistics, or exhibit a “semantic gap” by presenting data in machine addresses rather than source code constructs, which impedes targeted optimization of complex data-intensive programs. This paper introduces CATS (C Annotated Trace-based Cache Simulator), a novel hybrid method and toolset for detailed cache efficiency analysis, designed to overcome these limitations. CATS combines source-level static analysis with dynamic tracing at the intermediate representation (IR) level to generate semantically annotated memory traces, enabling precise identification of which source code data structures (arrays, structs, dynamically allocated objects) cause cache misses. The paper describes the methodology and architecture of CATS and presents a foundational validation of the approach through comparative accuracy analysis against reference simulators (gem5, Valgrind) on regular computational kernels (General Matrix Multiplication, GEMM). Systematic error analysis quantifies CATS’s accuracy bounds across different input sizes for the evaluated cache configuration (L1: 32 KB, L2: 256 KB). The current work explicitly focuses on single-threaded CPU-based C programs; extension to irregular kernels, multi-threaded workloads, hardware accelerators (GPU, FPGA), and specific AI applications are identified as future research. Early CATS application at the design stage enables identification of algorithmic cache bottlenecks before final implementation, complementing traditional compiler-level optimizations.
- Open Access
- 21 May 2026
- Published by MDPI AG in Preprints.org
CATS: A Tool for Semantically-Aware Cache Performance Analysis of C Programs
The rapid development of Artificial Intelligence (AI) and Machine Learning (ML) poses new challenges for high-performance system developers. The performance of such systems is often limited not by computational power, but by the efficiency of memory subsystem interaction. Cache behavior optimization becomes critically important, yet existing analysis tools fail to meet the demands of modern AI applications. They either provide only aggregated statistics or are characterized by a "semantic gap", presenting data in machine addresses rather than source code, which makes them ill-suited for analyzing the complex software systems typical of AI. This paper introduces CATS (C Annotated Trace-based Cache Simulator), a novel hybrid method and toolset for detailed cache efficiency analysis, designed to overcome these limitations. CATS combines dynamic tracing with static source code analysis to generate semantically annotated memory traces. This approach is particularly relevant for optimizing AI applications, as it allows precise identification of which data structures (e.g., weight matrices, tensors, or input vectors) are causing cache misses. For analyzing long-running tasks, such as training AI models, our method leverages AI techniques, specifically ML, for intelligent trace sampling, significantly reducing analysis time without sacrificing representativeness. The paper describes the methodology and architecture of CATS and presents experimental evaluation results. In the long term, the data collected by CATS can be used to train AI models capable of automatically providing developers with code refactoring recommendations to improve performance. Early CATS application identifies and resolves cache issues before final implementation, cutting performance optimization costs.
- 21 May 2026
- Published by MDPI AG in Preprints.org
Open AccessCATS: A Tool for Semantically-Aware Cache Performance Analysis of C Programs
The rapid development of Artificial Intelligence (AI) and Machine Learning (ML) poses new challenges for high-performance system developers. The performance of such systems is often limited not by computational power, but by the efficiency of memory subsystem interaction. Cache behavior optimization becomes critically important, yet existing analysis tools fail to meet the demands of modern AI applications. They either provide only aggregated statistics or are characterized by a "semantic gap", presenting data in machine addresses rather than source code, which makes them ill-suited for analyzing the complex software systems typical of AI. This paper introduces CATS (C Annotated Trace-based Cache Simulator), a novel hybrid method and toolset for detailed cache efficiency analysis, designed to overcome these limitations. CATS combines dynamic tracing with static source code analysis to generate semantically annotated memory traces. This approach is particularly relevant for optimizing AI applications, as it allows precise identification of which data structures (e.g., weight matrices, tensors, or input vectors) are causing cache misses. For analyzing long-running tasks, such as training AI models, our method leverages AI techniques, specifically ML, for intelligent trace sampling, significantly reducing analysis time without sacrificing representativeness. The paper describes the methodology and architecture of CATS and presents experimental evaluation results. In the long term, the data collected by CATS can be used to train AI models capable of automatically providing developers with code refactoring recommendations to improve performance. Early CATS application identifies and resolves cache issues before final implementation, cutting performance optimization costs.
- 2 January 2026
- Published by Springer Nature
- p. 103-112
Software Methods for Energy Consumption Evaluation
- 2 January 2026
- Published by Springer Nature
- p. 103-112
Software Methods for Energy Consumption Evaluation
- 17 July 2025
- Published by New Technologies Publishing House in INFORMACIONNYE TEHNOLOGII
- Vol. 31 (7)
A New Approach to Designing Efficient Software Systems for High-Performance Computing Based on Life Cycle Analysis
A new approach to designing effective software systems is proposed. In this case, efficiency improvement means minimizing any costs associated with a software system at various stages of the life cycle, including the cost of developing, modifying and operating a software system, and effective software systems are those systems that, among other systems designed to achieve a similar result, are associated with minimal costs at all stages the life cycle. The development stage is analyzed in detail, a comparison of the traditional approach to the design of software systems and the proposed new approach is carried out. The proposed approach to the design and modification of software systems is implemented for the task of developing algorithms for computationally complex procedures, which made it possible to reduce the number of iterations of software system development by 2-3 times, while reducing the time required to complete these iterations.
- 17 July 2025
- Published by New Technologies Publishing House in INFORMACIONNYE TEHNOLOGII
- Vol. 31 (7)
A New Approach to Designing Efficient Software Systems for High-Performance Computing Based on Life Cycle Analysis
A new approach to designing effective software systems is proposed. In this case, efficiency improvement means minimizing any costs associated with a software system at various stages of the life cycle, including the cost of developing, modifying and operating a software system, and effective software systems are those systems that, among other systems designed to achieve a similar result, are associated with minimal costs at all stages the life cycle. The development stage is analyzed in detail, a comparison of the traditional approach to the design of software systems and the proposed new approach is carried out. The proposed approach to the design and modification of software systems is implemented for the task of developing algorithms for computationally complex procedures, which made it possible to reduce the number of iterations of software system development by 2-3 times, while reducing the time required to complete these iterations.
- 1 December 2024
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 50 (S2) , S113-S119
A Method for Improving the Caching Strategy for Computing Systems with Shared Memory
A new method for improving the data caching strategy is considered. An analytical approach is implemented to evaluate software efficiency in terms of hierarchical memory usage. The proposed method is applied to the two-sided Householder transformation to convert an general matrix to the Hessenberg form. The paper also presents the results of computational experiments.
- 1 December 2024
- Published by Pleiades Publishing Ltd in Programming and Computer Software
- Vol. 50 (S2) , S113-S119
A Method for Improving the Caching Strategy for Computing Systems with Shared Memory
A new method for improving the data caching strategy is considered. An analytical approach is implemented to evaluate software efficiency in terms of hierarchical memory usage. The proposed method is applied to the two-sided Householder transformation to convert an general matrix to the Hessenberg form. The paper also presents the results of computational experiments.
- Open Access
- 2 October 2024
- Published by FSB Educational Establishment of Higher Education Daghestan State Technical University in Herald of Dagestan State Technical University. Technical Sciences
- Vol. 51 (3) , 60-71
Data caching technologies in modern microprocessors
Objective. The study presented in the paper is aimed at studying the methods for improving the efficiency of software in modern computing systems with a hierarchical memory structure. Method. The study is based on data caching technologies in microprocessors. Result. The article presents the results of the analysis of various approaches to the development of efficient software taking into account the characteristics of the memory subsystem of the computing system, which made it possible to prove the importance of cache memory in improving the performance and interaction of computer components. Conclusion. Cache memory is a critical element in the architecture of microprocessors, playing a key role in determining the performance of the computing system. Optimizing the use of cache can significantly improve data access time and, as a result, overall system performance. Software developers need to pay special attention to the characteristics of the memory subsystem when designing and implementing solutions.
- 2 October 2024
- Published by FSB Educational Establishment of Higher Education Daghestan State Technical University in Herald of Dagestan State Technical University. Technical Sciences
- Vol. 51 (3) , 60-71
Open AccessData caching technologies in modern microprocessors
Objective. The study presented in the paper is aimed at studying the methods for improving the efficiency of software in modern computing systems with a hierarchical memory structure. Method. The study is based on data caching technologies in microprocessors. Result. The article presents the results of the analysis of various approaches to the development of efficient software taking into account the characteristics of the memory subsystem of the computing system, which made it possible to prove the importance of cache memory in improving the performance and interaction of computer components. Conclusion. Cache memory is a critical element in the architecture of microprocessors, playing a key role in determining the performance of the computing system. Optimizing the use of cache can significantly improve data access time and, as a result, overall system performance. Software developers need to pay special attention to the characteristics of the memory subsystem when designing and implementing solutions.
- 24 September 2024
- Published by Springer Nature
- p. 195-208
The New Method for Automatic Vectorization Efficiency Increasing
- 24 September 2024
- Published by Springer Nature
- p. 195-208
The New Method for Automatic Vectorization Efficiency Increasing
- Open Access
- 16 April 2024
- Published by FSB Educational Establishment of Higher Education Daghestan State Technical University in Herald of Dagestan State Technical University. Technical Sciences
- Vol. 51 (1) , 87-94
Research on the effectiveness of data compression methods in relational and NoSQL DBMS
Objective.The research presented in the paper is aimed at studying the effectiveness of modern DBMSs.Method.Along with traditional relational solutions, NoSQL-based DBMSs are becoming increasingly popular. This is primarily due to the ability of such systems to store and process huge volumes of data. At the same time, to work effectively with this data, it is necessary to ensure its compression. Compression allows you to reduce the amount of stored data and provide quick access to it.Result.A comparative analysis of data compression in the MySQL and OpenSe DBMS was performed.Conclusion.Data compression in OpenSearch is more efficient than in MySQL when using standard algorithms. OpenSearch is an excellent choice if youneed to conserve storage resources while making optimal use of the processor, otherwise both systems will do the job well.
- 16 April 2024
- Published by FSB Educational Establishment of Higher Education Daghestan State Technical University in Herald of Dagestan State Technical University. Technical Sciences
- Vol. 51 (1) , 87-94
Open AccessResearch on the effectiveness of data compression methods in relational and NoSQL DBMS
Objective.The research presented in the paper is aimed at studying the effectiveness of modern DBMSs.Method.Along with traditional relational solutions, NoSQL-based DBMSs are becoming increasingly popular. This is primarily due to the ability of such systems to store and process huge volumes of data. At the same time, to work effectively with this data, it is necessary to ensure its compression. Compression allows you to reduce the amount of stored data and provide quick access to it.Result.A comparative analysis of data compression in the MySQL and OpenSe DBMS was performed.Conclusion.Data compression in OpenSearch is more efficient than in MySQL when using standard algorithms. OpenSearch is an excellent choice if youneed to conserve storage resources while making optimal use of the processor, otherwise both systems will do the job well.
- 1 January 2024
- Published by Informatization and Communication Journal Editorial Board in Informatization and communication
- Vol. 1
Evaluation of the efficiency of parallel algorithms using intel parallel studio
Егунов В.А., Шабаловский В.А. Оценка эффективности параллельных программ с использованием Intel Parallel Studio Резюме: В работе проводится анализ средств оценки эффективности параллельных программ. Исследование фокусируется на повышении производительности базовых операций линейной алгебры, выполняемых на параллельных вычислительных системах с общей памятью. Применяется среда Intel Parallel Studio, которая предоставляет мощный набор инструментов
- 1 January 2024
- Published by Informatization and Communication Journal Editorial Board in Informatization and communication
- Vol. 1
Evaluation of the efficiency of parallel algorithms using intel parallel studio
Егунов В.А., Шабаловский В.А. Оценка эффективности параллельных программ с использованием Intel Parallel Studio Резюме: В работе проводится анализ средств оценки эффективности параллельных программ. Исследование фокусируется на повышении производительности базовых операций линейной алгебры, выполняемых на параллельных вычислительных системах с общей памятью. Применяется среда Intel Parallel Studio, которая предоставляет мощный набор инструментов
- 14 October 2023
- Published by Springer Nature
- p. 433-449
Interaction with Virtual Objects in VR-Applications
- 14 October 2023
- Published by Springer Nature
- p. 433-449
Interaction with Virtual Objects in VR-Applications