A new method for determining the characteristics of block algorithms

Abstract

Objective. In the field of high-performance computing, optimization of software systems for specific computing architectures is of great importance. The aim of the study is to improve the methods for determining the parameters of block algorithms. Method. The study is based on the methodology of computer modeling and automated design in engineering and technology, including the formulation, formalization and typification of design procedures and algorithms. Result. An analytical approach to improving the efficiency of designed software systems is proposed, within the framework of which a method for determining the parameters of block algorithms is considered. The advantage of this method is the possibility of its implementation based on static analysis of the source code of the program at the initial stages of design; the obtained parameters can be used in the optimization process. Computational experiments confirming the efficiency of the proposed method were conducted. Conclusion. The proposed method allows determining the block sizes at which no cache misses will be generated at a certain level of cache memory or the number of these misses will remain at an acceptable level. The method can be used at the initial stages of designing software systems without resorting to dynamic analysis of the application; in this case, static analysis of the program source code is used.