Research and Selection of Rational Methods for Obtaining Framework of Schedules for the Parallel Programs Execution

P. 268–280.

Bakanov V. M.

This paper deals with the creation of rational methods for developing a schedule (execution plan) of programs for parallel computing systems of a given (homo- and heterogeneous) architecture for arbitrary algorithms.  To solve this task, a software system is proposed that allows the implementation of various (heuristic) methods for building up an execution schedule for parallel programs and to quantitatively evaluate and compare the computational complexity of these methods.  The quantitative results gained from the application of some methods for constructing rational parallel execution plans for classical data processing algorithms are presented. #COMESYSO1120

Keywords: графовые представления алгоритма, рациональные параметры выполнения параллельных программ, graph representations of the algorithm, analysis of the thin program information structure, purposeful reorganization of the stacked-parallel form of the data dependence graph, rational parameters of parallel programs execution, parallel program execution framework, анализ тонкой информационной структуры программы, целенаправленная реорганизация ярусно-параллельной формы информационного графа алгоритма, каркас выполнения параллельной программы, методика построения рационального плана выполнения параллельной программы

In book

Lecture Notes in Networks and Systems (LNNS, volume 231) Proceedings of 5th Computational Methods in Systems and Software 2021 (CoMeSySo 2021)

Vol. Vol 2: Data Science and Intelligent Systems. Issue 231. , Springer, 2021.