Workflow scheduling method under unbalanced conditions based on dynamic allocation algorithm Online publication date: Wed, 31-Jan-2024
by Wenyan Zhao; Lixia Hou; Jie Zhao
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 15, No. 3/4, 2023
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com