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.
References
grid computing, Numerical analysis and scientific computing. CRC Press, UK, 2009.
2. Magoulès F. ed. Fundamentals of grid computing: theory, algorithms and technologies, Numerical
analysis and scientific computing. CRC Press, UK, 2010.
3. Patel S. Survey Report of Job Scheduler on Grids, International Journal of Emerging Research
in Management &Technology, 2013, 2 (4), pp. 115-125.
4. Li M., Baker M. The grid: core technologies. John Wiley & Sons Ltd, England. 2005.
5. Saak A.E., Kureichik V.V., Kravchenko Y.A. Scheduling quality of precise form sets which
consist of tasks of circular type in GRID systems, Journal of Physics: Conference Series,
2018, 1015 (4).
6. Saak A.E., Kureichik V.V., Lezhebokov A.A. Scheduling of parabolic-type tasks arrays in GRID
systems, Advances in Intelligent Systems and Computing, 2017, pp. 292-298.
7. Saak A., Kureichik, V., Kravchenko Y. To scheduling quality of sets of precise form which
consist of tasks of circular and hyperbolic type in grid systems, Advances in Intelligent Systems
and Computing, 2016, pp. 157-166.
8. Saak A.E., Kureichik V.V., Kuliev E.V. Ring algorithms for scheduling in grid systems, Advances
in Intelligent Systems and Computing, 2015, pp. 201-209.
9. Wäscher G., Hauβner H., Schumann H.. An improved typology of cutting and packing problems.
European Journal of Operational Research, 2007, Vol. 183, pp. 1109-1130.
10. Huang E., Korf R. Optimal rectangle packing: an absolute placement approach. Journal of
Artificial Intelligence Research, 2012, Vol. 46, pp. 47-87.
11. Simonis H., O'Sullivan B. Search strategies for rectangle packing. In Stuckey, P. (ed.), 14th
International Conference on Principles and Practice of Constraint Programming (CP 2008),
Vol. 5202 of Lecture Notes in Computer Science. Springer, 2008, pp. 52-66.
12. Clautiaux F., Carlie, J., Moukrim A. A new exact method for the two-dimensional orthogonal packing
problem, European Journal of Operational Research, 2007, Vol. 183 (3), pp. 1196-1211.
13. Bastos-Filho C.J.A., Lima-Neto F.B., Lins Sousa M.F.C., Pontes M.R. On the influence of the
swimming operators in the fish school search algorithm, IEEE International Conference on
Systems Man and Cybernetics, 2009 pp. 5012-5017.
14. Kenmochi M., Imamichi T., Nonobe K., Yagiura M., Nagamochi H. Exact algorithms for the
two- dimensional strip packing problem. European Journal of Operational Research, 2009,
Vol. 198, pp. 73-83.
15. Moffitt M., Pollack M. Optimal rectangle packing: a meta-csp approach. In Long, D., Smith,
S., Borrajo, D., McCluskey, L. (ed)., ICAPS, 2006, pp. 93-102. AAAI.
16. Hifi M., Ouafi R. A best-first branch-and-bound algorithm for orthogonal rectangular packing
problems. Int. Trans. in Operational Research, 1998, No. 5 (5), pp. 345-356.
17. Foster I., Kesselman C. The Grid in a nutshell. In: Nabrzyski, J., Schopf, J., Weglarz, J. (ed.)
Grid Resource Management: state of the art and future trends. Kluwer, 2003.
18. Kureychik V.M. Overview and problem state of ontology models development, 9th International
Conference on Application of Information and Communication Technologies, AICT
2015 - Proceedings 9, 2015, pp. 558-564.
19. Semenova A.V. and Kureychik V.M. Application of swarm intelligence for domain ontology
alignment, Proceedings of the First International Scientific Conference “Intelligent Information
Technologies for Industry” (IITI’16), 2016, Vol. 1, pp.261-270.
20. Bova V., Kureichik V. and Zaruba D. Heuristic approach to model of corporate knowledge
construction in information and analytical systems, 2016 IEEE 10th International Conference
on Application of Information and Communication Technologies (AICT), Baku, 2016, pp. 1-5.
21. Kureichik V., Zaporozhets D., and Zaruba D. Generation of bioinspired search procedures for
optimization problems, Application of Information and Communication Technologies, AICT
2016 - Conference Proceedings, 2016, Vol. 10.
22. Pulyavina N., Taratukhin V. The Future of Project-Based Learning for Engineering and Management
Students: Towards an Advanced Design Thinking Approach, ASEE Annual Conference
and Exposition, Conference Proceeding, 2018, No. 125.
23. Becker J. Next-Gen Design Thinking. Using Project-Based and Game-Oriented Approaches to
Support Creativity and Innovation, J. Becker, N. Pulyavina, V. Taratukhin // Proceedings of
the 1st International Conference of Information Systems and Design, 2020.
24. Bova V.V., Nuzhnov E.V., Kureichik V.V. The combined method of semantic similarity estimation
of problem oriented knowledge on the basis of evolutionary procedures, Advances in Intelligent
Systems and Computing, 2017, Vol. 573, pp. 74-83.
