A Two-Stage Multi-Objective Task Scheduling Framework Based on Invasive Tumor Growth Optimization Algorithm for Cloud Computing

被引:4
|
作者
Hu, Qianxue [1 ]
Wu, Xiaofei [1 ]
Dong, Shoubin [1 ]
机构
[1] South China Univ Technol, Sch Comp Sci & Engn, Comnun & Comp Network Lab GD, Guangzhou 510000, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-objective optimization; Task scheduling; Cloud computing; MSITGO;
D O I
10.1007/s10723-023-09665-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Task scheduling in cloud computing is usually required to achieve multiple goals from the perspective of cloud service providers, users, environmental benefits, and so on. However, there are often conflictions among these goals, and the constraints might be diverse and strict. Since scheduling strategies need to be made efficiently and effectively, multi-objective task scheduling optimization becomes a huge challenge. Aiming at collaboratively optimizing three conflicting goals, including batch task completion time, energy consumption and idle resource costs, this paper proposes a multi-objective scheduling framework MSITGO based on Invasive Tumor Growth Optimization (ITGO). MSITGO utilizes the characteristics of tumor cell growth model and adopts the Pareto optimal model and packing problem model to perform a fine-grained and efficient search in solution space, which effectively enhances the diversity of solutions and increases the speed of convergence. In addition, considering an entire task processing procedure, MSITGO assembles the task scheduling process into two stages as machine assignment and timeslot allocation, to further improve the task scheduling performance and reduce unreasonable allocations. Experimental results on real-world cluster data from Alibaba show that MSITGO can provide a better solution to the proposed multi-objective task scheduling problem compared with other state-of-the-art algorithms.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] A Two-Stage Multi-Objective Task Scheduling Framework Based on Invasive Tumor Growth Optimization Algorithm for Cloud Computing
    Qianxue Hu
    Xiaofei Wu
    Shoubin Dong
    [J]. Journal of Grid Computing, 2023, 21
  • [2] Multi-objective Task Scheduling Optimization in Cloud Computing based on Genetic Algorithm and Differential Evolution Algorithm
    Li, Yuqing
    Wang, Shichuan
    Hong, Xin
    Li, Yongzhi
    [J]. 2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 4489 - 4494
  • [3] Multi-objective Task Scheduling Optimization Based on Improved Bat Algorithm in Cloud Computing Environment
    Yu, Dakun
    Xu, Zhongwei
    Mei, Meng
    [J]. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2023, 14 (06) : 1091 - 1100
  • [4] Multimodal and multi-objective optimization algorithm based on two-stage search framework
    Zhang, Jia-Xing
    Chu, Xiao-Kai
    Yang, Feng
    Qu, Jun-Feng
    Wang, Shen-Wen
    [J]. APPLIED INTELLIGENCE, 2022, 52 (11) : 12470 - 12496
  • [5] Multimodal and multi-objective optimization algorithm based on two-stage search framework
    Jia-Xing Zhang
    Xiao-Kai Chu
    Feng Yang
    Jun-Feng Qu
    Shen-Wen Wang
    [J]. Applied Intelligence, 2022, 52 : 12470 - 12496
  • [6] Multi-Objective Task Scheduling Optimization in Cloud Computing: An Appraisal
    Gabi, Danlami
    Ismail, Abdul Samad
    Zainal, Anazida
    Zakaria, Zalmiyah
    [J]. ADVANCED SCIENCE LETTERS, 2018, 24 (05) : 3609 - 3615
  • [7] Multi-objective task scheduling in cloud computing
    Malti, Arslan Nedhir
    Hakem, Mourad
    Benmammar, Badr
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (25):
  • [9] An Improved Multi-Objective Optimization Algorithm Based on NPGA for Cloud Task Scheduling
    Peng Yue
    Xue Shengjun
    Li Mengying
    [J]. INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING, 2016, 9 (04): : 161 - 176
  • [10] Virtual Machines Scheduling Algorithm Based on Multi-objective Optimization in Cloud Computing
    Zhu, JianRong
    Zhuang, Yi
    Li, Jing
    Zhu, Wei
    [J]. ADVANCED DEVELOPMENT OF ENGINEERING SCIENCE IV, 2014, 1046 : 508 - 511