The list algorithms accuracy characteristics improvement based on Krohn’s algorithm and its modifications

Abstract

The research of algorithms for uniform loading of devices for homogeneous information processing systems is a very important science-intensive task. An experimental approach was chosen for the research. This is primarily due to the fact that the analytical solution of the distribution problem gives solutions that are far from reality, since it is unable to take into account many factors that affect the computing machine during its operation. The aim of this research is to improve the accuracy characteristics of the list algorithms through the use of heuristic algorithms, such as Krohn’s algorithm and its modifications. This made it possible to obtain a more even distribution of tasks among executive devices, which can be networked workstations, processors or processor cores. The work uses list algorithms, such as the Critical Path algorithm and Pashkeev’s algorithm, as well as heuristic algorithms - Krohn’s algorithm and its modifications. The main idea of the research is to obtain the best suboptimal solution by improving the quality of the resulting distribution. In this case, with the help of the list algorithms, the initial distribution is formed, and its refinement is carried out through the application of the Krohn’s algorithm and its modifications. In fact, in the work, a number of symbiotic algorithms are examined and analyzed. For this, many computational experiments were carried out and a large amount of output data were collected, on the basis of which conclusions were drawn about the effectiveness of the solution obtained for each symbiotic group and for all groups as a whole.