Vladimir Shabalovsky
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Vladimir Shabalovsky has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Vitaly Egunov
Volgograd State Technical University
3 shared publications - Alla Grigorievna Kravets
Volgograd State Technical University
2 shared publications - Anna Matokhina
Volgograd State Technical University
2 shared publications - Pavel Kravchenya
Computers and Systems Department, Volgograd State Technical University, Volgograd 400005, Russia
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.
- 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.