Improved swarm search algorithm for scheduling budget-constrained workflows in the cloud

被引:10
|
作者
Li, Huifang [1 ]
Wang, Danjing [1 ]
Xu, Guanghao [1 ]
Yuan, Yan [1 ]
Xia, Yuanqing [1 ]
机构
[1] Beijing Inst Technol, Sch Automat, Beijing 100081, Peoples R China
基金
中国国家自然科学基金;
关键词
Cloud computing; Workflow scheduling; Budget constraints; Compute-intensive applications; Meta-heuristics; SCIENTIFIC WORKFLOWS;
D O I
10.1007/s00500-022-06782-w
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Basic science is becoming more computing intensive with the incremental need for large-scale computing and storage resources. Cloud computing provides great potentials for hosting and executing scientific applications, which can be represented as workflows for automatic execution and run time provisioning. However, workflow scheduling is highly challenging under dynamic cloud environments since certain runtime QoS. In this paper, we propose an improved swarm search algorithm, i.e., an Owl Search Algorithm embedded with a newly designed Mutation strategy (OSAM) for scheduling workflows with makespan minimized under budget constraints. A population update mechanism, where each particle is updated in term of the impact of current best solution, is modified for an Owl Search Algorithm (OSA) to address discrete sequential optimization problems. We then adjust a step parameter beta such that it decreases adaptively with the number of iterations to enhance OSAM's convergence speed. To further increase the diversity of population and enlarge OSAM's global search ability, we embed amutation strategy into OSA's evolutionary process for better balancing between exploitation and exploration. A series of experiments are conducted to verify the proposed algorithm by comparing with benchmarking algorithms over well-known scientific workflows with different types and sizes through WorkflowSim. Experimental results show that in almost all the cases, the proposed OSAM outperforms the existing algorithms in the solution quality and constraint satisfiability, i.e., it can find near-optimal solutions that meet the tight and loose budget constraints within an acceptable time interval, especially in addressing large-scale applications, e.g., its RSR values are at least 0.10 greater than other algorithms in these cases. Besides, a nonparametric statistical hypothesis test, i.e., Wilcoxon signed-rank test, is applied to the resulting solutions, and the testing results demonstrate that our OSAM is significantly different from its peers.
引用
收藏
页码:3809 / 3824
页数:16
相关论文
共 50 条
  • [1] Improved swarm search algorithm for scheduling budget-constrained workflows in the cloud
    Huifang Li
    Danjing Wang
    Guanghao Xu
    Yan Yuan
    Yuanqing Xia
    [J]. Soft Computing, 2022, 26 : 3809 - 3824
  • [2] Task Duplication-Based Scheduling Algorithm for Budget-Constrained Workflows in Cloud Computing
    Yao, Fuguang
    Pu, Changjiu
    Zhang, Zongyin
    [J]. IEEE ACCESS, 2021, 9 : 37262 - 37272
  • [3] Mutation-driven and population grouping PRO algorithm for scheduling budget-constrained workflows in the cloud
    Huifang Li
    Bing Chen
    Jingwei Huang
    Julio Ruben Cañizares Abreu
    Senchun Chai
    Yuanqing Xia
    [J]. Cluster Computing, 2024, 27 : 1137 - 1158
  • [4] Mutation-driven and population grouping PRO algorithm for scheduling budget-constrained workflows in the cloud
    Li, Huifang
    Chen, Bing
    Huang, Jingwei
    Abreu, Julio Ruben Canizares
    Chai, Senchun
    Xia, Yuanqing
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (01): : 1137 - 1158
  • [5] Scheduling Budget Constrained Cloud Workflows With Particle Swarm Optimization
    Wang, Xiaotong
    Cao, Bin
    Hou, Chenyu
    Xiong, Lirong
    Fan, Jing
    [J]. 2015 IEEE CONFERENCE ON COLLABORATION AND INTERNET COMPUTING (CIC), 2015, : 219 - 226
  • [6] Time optimization heuristics for scheduling budget-constrained grid workflows
    Yuan, Yingchun
    Li, Xiaoping
    Wang, Qian
    Wang, Kejian
    [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2009, 46 (02): : 194 - 201
  • [7] Budget-constrained search
    Manning, R
    Manning, JRA
    [J]. EUROPEAN ECONOMIC REVIEW, 1997, 41 (09) : 1817 - 1834
  • [8] Dynamic Budget-Constrained Pricing in the Cloud
    Friedman, Eric
    Racz, Miklos Z.
    Shenker, Scott
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE (AI 2015), 2015, 9091 : 114 - 121
  • [9] Task scheduling in budget-constrained cloud computing systems to maximise throughput
    Shi, Weiming
    Hong, Bo
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2012, 7 (04) : 319 - 328
  • [10] An energy-aware scheduling algorithm for budget-constrained scientific workflows based on multi-objective reinforcement learning
    Yao Qin
    Hua Wang
    Shanwen Yi
    Xiaole Li
    Linbo Zhai
    [J]. The Journal of Supercomputing, 2020, 76 : 455 - 480