Scheduling based on a dynamic resource connection

Bibliographic Details
Parent link:IOP Conference Series: Materials Science and Engineering
Vol. 177 : Mechanical Engineering, Automation and Control Systems (MEACS 2016).— 2017.— [012030, 6 p.]
Corporate Authors: Национальный исследовательский Томский политехнический университет (ТПУ) Институт кибернетики (ИК), Национальный исследовательский Томский политехнический университет (ТПУ) Физико-технический институт (ФТИ) Кафедра высшей математики и математической физики (ВММФ)
Other Authors: Nagiyev A. E., Botygin I. A. Igor Aleksandrovich, Sherstneva A. I. Anna Igorevna, Konyaev P. A.
Summary:Title screen
The practical using of distributed computing systems associated with many problems, including troubles with the organization of an effective interaction between the agents located at the nodes of the system, with the specific configuration of each node of the system to perform a certain task, with the effective distribution of the available information and computational resources of the system, with the control of multithreading which implements the logic of solving research problems and so on. The article describes the method of computing load balancing in distributed automatic systems, focused on the multi-agency and multi-threaded data processing. The scheme of the control of processing requests from the terminal devices, providing the effective dynamic scaling of computing power under peak load is offered. The results of the model experiments research of the developed load scheduling algorithm are set out. These results show the effectiveness of the algorithm even with a significant expansion in the number of connected nodes and zoom in the architecture distributed computing system.
Published: 2017
Series:Information technologies in Mechanical Engineering
Subjects:
Online Access:http://dx.doi.org/10.1088/1757-899X/177/1/012030
http://earchive.tpu.ru/handle/11683/37843
Format: Electronic Book Chapter
KOHA link:https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=654025