Static-dynamic algorithm for managing asynchronous computations in distributed environments
Keyword(s):
Np Hard
◽
The paper addresses a relevant problem of computation scheduling in scientific applications (distributed applied software packages) executed in distributed environments. Forming an optimal schedule of jobs for executing of applied software (modules) is an NP-hard problem. Therefore, in practice, heuristic methods of scheduling are often used. In this regard, we propose a new static-dynamic algorithm for managing computations in heterogeneous distributed environments. The results of operating the proposed algorithm are simulated in comparison with other scenarios for computing management. They show that applying the algorithm makes it possible to achieve a rational balance between the scheduling time and the computations makespan.
2015 ◽
Vol 23
(4)
◽
pp. 1092-1106
◽
Multi-robot informative path planning in unknown environments through continuous region partitioning
2020 ◽
Vol 17
(6)
◽
pp. 172988142097046
Keyword(s):
Np Hard
◽
1993 ◽
Vol 55
(6)
◽
pp. 1183-1198
◽