CENTRAL-RING POLYNOMIAL ALGORITHM FOR DISTRIBUTION OF COMPUTATION-TIME RESOURCES IN GRID SYSTEMS

Abstract

The article is devoted to solving the problem of computational and time resources distribution in 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 paradigm in the context of information redistribution and uncertainty. The article deals with the problems of scheduling heterogeneous computing resources in solving complex professional and scientific problems achieved at different points in time, based on identifying resources by significant manifestations of commitment and probability. A comparative review of consumption has been carried out. The statement of the problem to be solved in the chosen research area is formulated. The problem of scheduling a grid system with a centralized multiarchitecture, which uses the task solution of a group-site, is substantiated. The use of this architecture requires the development of heuristic algorithms for the distribution of computing resources, taking into account the properties of application arrays and assessing the schedule compliance. Eliminating the occurrence of scheduling errors requires the development of a formal apparatus that will identify the prospects of the application, introduce their 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 the framework of this mechanism is the construction of resource parity models and interaction between users and the computing system models. The authors proposed to solve the problem of scheduling computing resources based on the development and study of polynomial scheduling algorithms for arrays of hyperbolic applications. The main theoretical accuracy of this study is the creation of a formal 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 resource muscles. The scientific novelty of the research lies in the development of a central-ring polynomial algorithm for the distribution of computational time resources in grid systems, which involves an automatic scheduling algorithm for computing systems, adaptation to quadratic types of user applications and improves the efficiency of computational time resources distribution. To evaluate the developed efficiency of the software application algorithm and the conducted computational experiment with rapidly generated classes of computational resources. Obtained comparative results of the proposed algorithm practical efficiency experimental studies for the distribution of computational and time resources. The described studies have a high level of theoretical and practical significance and are directly related to the solution of artificial intelligence classical problems.