.png){kind=icon}
返回
Optimized task scheduling in cloud computing using improved multi-verse optimizer
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-022-03650-y.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The multiverse optimizer (MVO) is one of the most trending algorithms used nowadays. The searching space in MVO is restricted by the best solution only, leading to a poor searching domain, therefore, a long searching time. This paper proposes an improved multiobjective multi-verse optimizer (IMOMVO) as a novel population optimization technique to solve task scheduling problems. The IMOMVO is introduced to overcome the drawbacks risen in the original MVO and its latest enhanced version mMVO. The proposed method solves the problem of the average positioning (AP) by dynamically enhancing the equation of updating the AP based on the best and the second-best available solutions. To evaluate The proposed IMOMVO, several datasets scenarios containing various tasks and virtual machines (Vms) were used to test the approach's capability. Standard evaluation metrics are used to validate the results of the proposed method; task execution time, throughput, and the Vms processing power. The proposed method obtained better results according to the evaluation measures than other state-of-the-art methods. The execution time achieves less time when compared to the mMVO as the proposed method achieved 186.33 s for executing 100 tasks and 934.92 for executing 600 tasks. The throughput results also achieved astonishing results as for 100 tasks, the throughput achieved 0.19, and the Vm processing power for the proposed method was 0.25 Kw for executing 100 tasks.
Keyword:
Multiverse optimizer
Cloud computing
Task scheduling
Optimization
Algorithms
期刊
C
IF:
4.1
论文数:
5.1K
被引数:
8.7K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Farmland fertility: A new metaheuristic algorithm for solving continuous optimization problems农田肥力: 解决连续优化问题的一种新的元启发式算法
PREAI
分享收藏
查看更多内容