Amended hybrid multi-verse optimizer with genetic algorithm for solving task scheduling problem in cloud computing

被引:89
作者
Abualigah, Laith [1 ,2 ]
Alkhrabsheh, Muhammad [1 ]
机构
[1] Amman Arab Univ, Fac Comp Sci & Informat, Amman 11953, Jordan
[2] Univ Sains Malaysia, Sch Comp Sci, Gelugor 11800, Pulau Pinang, Malaysia
关键词
Cloud computing; Task scheduling; Multi-verse optimizer; Genetic algorithm; Hybrid method;
D O I
10.1007/s11227-021-03915-0
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The central cloud facilities based on virtual machines offer many benefits to reduce the scheduling costs and improve service availability and accessibility. The approach of cloud computing is practical due to the combination of security features and online services. In the tasks transfer, the source and target domains have differing feature spaces. This challenge becomes more complicated in network traffic, which leads to data transfer delay, and some critical tasks could not deliver at the right time. This paper proposes an efficient optimization method for task scheduling based on a hybrid multi-verse optimizer with a genetic algorithm called MVO-GA. The proposed MVO-GA is proposed to enhance the performance of tasks transfer via the cloud network based on cloud resources' workload. It is necessary to provide adequate transfer decisions to reschedule the transfer tasks based on the gathered tasks' efficiency weight in the cloud. The proposed method (MVO-GA) works on multiple properties of cloud resources: speed, capacity, task size, number of tasks, number of virtual machines, and throughput. The proposed method successfully optimizes the task scheduling of a large number of tasks (i.e., 1000-2000). The proposed MVO-GA got promising results in optimizing the large cloud tasks' transfer time, which reflects its effectiveness. The proposed method is evaluated based on using the simulation environment of the cloud using MATLAB distrusted system.
引用
收藏
页码:740 / 765
页数:26
相关论文
共 49 条
[1]  
Abualigah L., 2020, SWARM INTELLIGENCE C, P127, DOI DOI 10.1201/9780429020582-5
[2]   Aquila Optimizer: A novel meta-heuristic optimization algorithm [J].
Abualigah, Laith ;
Yousri, Dalia ;
Abd Elaziz, Mohamed ;
Ewees, Ahmed A. ;
Al-qaness, Mohammed A. A. ;
Gandomi, Amir H. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157 (157)
[3]   A novel feature selection method for data mining tasks using hybrid Sine Cosine Algorithm and Genetic Algorithm [J].
Abualigah, Laith ;
Dulaimi, Akram Jamal .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (03) :2161-2176
[4]   The Arithmetic Optimization Algorithm [J].
Abualigah, Laith ;
Diabat, Ali ;
Mirjalili, Seyedali ;
Elaziz, Mohamed Abd ;
Gandomi, Amir H. .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2021, 376
[5]   Advances in Sine Cosine Algorithm: A comprehensive survey [J].
Abualigah, Laith ;
Diabat, Ali .
ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (04) :2567-2608
[6]   A parallel hybrid krill herd algorithm for feature selection [J].
Abualigah, Laith ;
Alsalibi, Bisan ;
Shehab, Mohammad ;
Alshinwan, Mohammad ;
Khasawneh, Ahmad M. ;
Alabool, Hamzeh .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2021, 12 (03) :783-806
[7]   A comprehensive survey of the Grasshopper optimization algorithm: results, variants, and applications [J].
Abualigah, Laith ;
Diabat, Ali .
NEURAL COMPUTING & APPLICATIONS, 2020, 32 (19) :15533-15556
[8]   Selection scheme sensitivity for a hybrid Salp Swarm Algorithm: analysis and applications [J].
Abualigah, Laith ;
Shehab, Mohammad ;
Diabat, Ali ;
Abraham, Ajith .
ENGINEERING WITH COMPUTERS, 2022, 38 (02) :1149-1175
[9]   A Comprehensive Survey of the Harmony Search Algorithm in Clustering Applications [J].
Abualigah, Laith ;
Diabat, Ali ;
Geem, Zong Woo .
APPLIED SCIENCES-BASEL, 2020, 10 (11)
[10]   A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments [J].
Abualigah, Laith ;
Diabat, Ali .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (01) :205-223