Task scheduling in cloud computing environment based on enhanced marine predator algorithm

被引:9
作者
Gong, Rong [1 ]
Li, DeLun [2 ]
Hong, LiLa [1 ]
Xie, NingXin [1 ]
机构
[1] Guangxi Minzu Univ, Sch Artificial Intelligence, Nanning 530006, Guangxi, Peoples R China
[2] Guangxi Minzu Univ, Coll Elect Informat, Nanning 530006, Guangxi, Peoples R China
来源
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS | 2024年 / 27卷 / 01期
关键词
Marine predator algorithm; Task scheduling; Cloud computing; Meta-heuristic; Golden sine strategy;
D O I
10.1007/s10586-023-04054-2
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud computing has experienced extraordinary development across a wide range of industries by giving customers the flexibility to employ computing resources as needed. The task scheduling problem is one of several major challenges in cloud computing, and it should be scheduled effectively to minimize makespan and maximize resource utilization. Therefore, this paper put forward an improved scheduling efficiency algorithm called Enhanced Marine Predator Algorithm (EMPA). Firstly, task scheduling model with makespan and resource utilization is constructed. Secondly, each individual represents a result of task scheduling, and the purpose of algorithms is to find the optimal scheduling result, therefore the operator of WOA, nonlinear inertia weight coefficient and golden sine strategy are introduced into Marine Predator Algorithm. In the simulation experiment, EMPA is compared with Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) under different number of tasks in synthetic datasets and GoCJ datasets.The experimental results show that the EMPA algorithm has more advantages in terms of makespan, degree of imbalance, and resource utilization.
引用
收藏
页码:1109 / 1123
页数:15
相关论文
共 32 条
  • [1] Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution
    Abd Elaziz, Mohamed
    Xiong, Shengwu
    Jayasena, K. P. N.
    Li, Lin
    [J]. KNOWLEDGE-BASED SYSTEMS, 2019, 169 : 39 - 52
  • [2] A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments
    Abualigah, Laith
    Diabat, Ali
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (01): : 205 - 223
  • [3] Aladwani T., 2020, IntechOpen, DOI [10.5772/intechopen.86873, DOI 10.5772/INTECHOPEN.86873]
  • [4] An Intelligent Chimp Optimizer for Scheduling of IoT Application Tasks in Fog Computing
    Attiya, Ibrahim
    Abualigah, Laith
    Elsadek, Doaa
    Chelloug, Samia Allaoua
    Abd Elaziz, Mohamed
    [J]. MATHEMATICS, 2022, 10 (07)
  • [5] Task Scheduling in Cloud Computing Environment by Grey Wolf Optimizer
    Bacanin, Nebojsa
    Bezdan, Timea
    Tuba, Eva
    Strumberger, Ivana
    Tuba, Milan
    Zivkovic, Miodrag
    [J]. 2019 27TH TELECOMMUNICATIONS FORUM (TELFOR 2019), 2019, : 727 - 730
  • [6] A WOA-Based Optimization Approach for Task Scheduling in Cloud Computing Systems
    Chen, Xuan
    Cheng, Long
    Liu, Cong
    Liu, Qingzhi
    Liu, Jinwei
    Mao, Ying
    Murphy, John
    [J]. IEEE SYSTEMS JOURNAL, 2020, 14 (03): : 3117 - 3128
  • [7] A modified salp swarm algorithm for task assignment problem
    El-Ashmawi, Walaa H.
    Ali, Ahmed F.
    [J]. APPLIED SOFT COMPUTING, 2020, 94
  • [8] Marine Predators Algorithm: A nature-inspired metaheuristic
    Faramarzi, Afshin
    Heidarinejad, Mohammad
    Mirjalili, Seyedali
    Gandomi, Amir H.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 152
  • [9] Task scheduling of cloud computing based on hybrid particle swarm algorithm and genetic algorithm
    Fu, Xueliang
    Sun, Yang
    Wang, Haifang
    Li, Honghui
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2023, 26 (05): : 2479 - 2488
  • [10] Energy-aware task assignment for mobile cyber-enabled applications in heterogeneous cloud computing
    Gai, Keke
    Qiu, Meikang
    Zhao, Hui
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2018, 111 : 126 - 135