ЦЕНТРАЛЬНО-КОЛЬЦЕВОЙ ПОЛИНОМИАЛЬНЫЙ АЛГОРИТМ РАСПРЕДЕЛЕНИЯ ВЫЧИСЛИТЕЛЬНО-ВРЕМЕННЫХ РЕСУРСОВ В ГРИД-СИСТЕМАХ

Abstract

The article is devoted to solving the problem of computational and time resources distributionin grid systems based on the adaptation of polynomial algorithms to quadratic types of user applications.The relevance of demand distribution validity problem for the distributed computing paradigmin the context of information redistribution and uncertainty. The article deals with the problems ofscheduling heterogeneous computing resources in solving complex professional and scientific problemsachieved at different points in time, based on identifying resources by significant manifestationsof commitment and probability. A comparative review of consumption has been carried out. Thestatement of the problem to be solved in the chosen research area is formulated. The problem ofscheduling a grid system with a centralized multiarchitecture, which uses the task solution of agroup-site, is substantiated. The use of this architecture requires the development of heuristic algorithmsfor the distribution of computing resources, taking into account the properties of applicationarrays and assessing the schedule compliance. Eliminating the occurrence of scheduling errors requiresthe development of a formal apparatus that will identify the prospects of the application, introducetheir typing and build heuristic algorithms with quality assessment, selected for certain types.The development of such a formal apparatus is an urgent task. An equally important task within theframework of this mechanism is the construction of resource parity models and interaction betweenusers and the computing system models. The authors proposed to solve the problem of schedulingcomputing resources based on the development and study of polynomial scheduling algorithms forarrays of hyperbolic applications. The main theoretical accuracy of this study is the creation of aformal scheduling apparatus, including the definition of resource sugar, as a model of user applications,based on the performance of an operation in the scheduling environment on a set of resourcemuscles. The scientific novelty of the research lies in the development of a central-ring polynomialalgorithm for the distribution of computational time resources in grid systems, which involves anautomatic scheduling algorithm for computing systems, adaptation to quadratic types of user applicationsand improves the efficiency of computational time resources distribution. To evaluate thedeveloped efficiency of the software application algorithm and the conducted computational experimentwith rapidly generated classes of computational resources. Obtained comparative results of theproposed algorithm practical efficiency experimental studies for the distribution of computationaland time resources. The described studies have a high level of theoretical and practical significanceand are directly related to the solution of artificial intelligence classical problems.