Efficient Algorithm Set Forming for the Computing Resources Distribution in Heterogeneous Dynamic Computational Environments Based on the Ontology Usage

Abstract

Purpose of research. The purpose of this research is to develop an ontology structure as the basis of a database/knowledge base for selecting effective metaheuristic algorithms for solving the problem of load distribution in heterogeneous distributed dynamic computing environments, taking into account the overhead of data transmission over the network.Methods. The main scientific methods used in this study are domain analysis, methods for constructing subject ontologies, numerical optimization methods and computer modeling.Since the literature does not present resource allocation planning models that would take into account geographic distribution, the presence of intermediate data transmission routes, the dynamics of topologies and load, as well as system heterogeneity in terms of criteria for assessing the quality of load distribution, this article proposes a new model that takes into account these features. The complexity of solving a planning problem becomes one of the variable parameters, which has a significant impact on the planning result: with a decrease in the complexity of calculations, the result deteriorates accordingly. Therefore, a greedy strategy is proposed as a solution method: from the optimization methods to be considered, select the least labor-intensive one that would allow obtaining the best result in the allotted time. Test runs of simulated annealing algorithms demonstrate different effectiveness under different initial conditions of the problem; therefore, it is advisable for selected classes of problems to choose algorithms that are effective in terms of solution quality and labor intensity.Results. The result of the study is the structure of the ontology of effective algorithms. Also, the results are instances of simulated annealing algorithms and tasks included in the ontology, related by the “efficiency” relation.Conclusion. This article proposes the structure of an ontology of effective optimization algorithms and an approach to solving the problem of distributing the computational load, taking into account the complexity of the distribution procedure through the “greedy” selection of the most effective optimization algorithms.