4.7 Article

Hybrid electro search with genetic algorithm for task scheduling in cloud computing

期刊

AIN SHAMS ENGINEERING JOURNAL
卷 12, 期 1, 页码 631-639

出版社

ELSEVIER
DOI: 10.1016/j.asej.2020.07.003

关键词

Cloud computing; Task scheduling; Electro-search algorithm; Genetic algorithm

向作者/读者索取更多资源

Cloud computing is a highly scalable on-demand Internet-based computing service used by various working and non-working classes globally. Task scheduling, a critical application for end-users and cloud service providers, faces challenges in finding optimal resources. The Hybrid Electro Search with a genetic algorithm (HESGA) proposed in this paper combines the advantages of genetic and electro search algorithms, outperforming existing scheduling algorithms.
Cloud computing is on-demand Internet-based computing, which is a highly scalable service adopted by different working and non-working classes of people around the globe. Task scheduling one of the critical applications used by end-users and cloud service providers. The significant challenging in the task scheduler is to find an optimal resource for the given input task. In this paper, we proposed Hybrid Electro Search with a genetic algorithm (HESGA) to improve the behavior of task scheduling by considering parameters such as makespan, load balancing, utilization of resources, and cost of the multi-cloud. The proposed method combined the advantage of a genetic algorithm and an electro search algorithm. The genetic algorithm provides the best local optimal solutions, whereas the Electro search algorithm provides the best global optima solutions. The proposed algorithm outperforms than existing scheduling algorithms such as Hybrid Particle Swarm Optimization Genetic Algorithm (HPSOGA), GA, ES, and ACO. (C) 2020 The Authors. Published by Elsevier B.V. on behalf of Faculty of Engineering, Ain Shams University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-ncnd/4.0/).

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据