Title: Workflow scheduling method under unbalanced conditions based on dynamic allocation algorithm

Authors: Wenyan Zhao; Lixia Hou; Jie Zhao

Addresses: Information Engineering Department, Hebei Tangshan Polytechnic College, Tangshan 063299, China ' Department of Modern Services, Hebei Women's Vocational College, Shijiazhuang 05000, China ' Information Engineering Department, Hebei Institute of Mechanical and Electrical Technology, Xing Tai 054000, China

Abstract: In order to improve the efficiency and fairness of workflow scheduling, consider the data correlation between task nodes, and adapt to different scenarios, an unbalanced workflow scheduling method based on dynamic allocation algorithm is proposed. The workflow structure is transformed to calculate the earliest and the latest start time of the node task. The workflow stage is divided, and the input parameters of the task are dynamically adjusted according to the output data amount of each stage of the workflow. The workflow scheduling model is established. Taking the total length of workflow scheduling as the solution goal, the global optimal solution of the whole workflow scheduling process is calculated and obtained. The experimental results show that the unfairness coefficient of this method is less than 0.15%, and the time span can be controlled within 150 s, which shows that this method is more effective and can ensure the running ability of workflow.

Keywords: dynamic allocation algorithm; workflow stage; non-equilibrium condition; workflow scheduling.

DOI: 10.1504/IJRIS.2023.136363

International Journal of Reasoning-based Intelligent Systems, 2023 Vol.15 No.3/4, pp.290 - 296

Received: 25 Aug 2022
Accepted: 11 Oct 2022
Published online: 31 Jan 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article