基于大黄蜂交配算法的云计算环境任务调度

Mohammad Alotaibi, Mohammad S. Almalag, Kyle Werntz
{"title":"基于大黄蜂交配算法的云计算环境任务调度","authors":"Mohammad Alotaibi, Mohammad S. Almalag, Kyle Werntz","doi":"10.1109/GCAIoT51063.2020.9345824","DOIUrl":null,"url":null,"abstract":"Tasks scheduling in cloud computing environment plays an important role for both Cloud Service Providers (CSPs) and the users of the services provided. Therefore, designing an efficient task scheduling algorithm, which fulfill the requirements of CSPs and their clients is essential. Several scheduling algorithms are proposed by various researchers for task scheduling in cloud computing environments. This paper introduces an alternative method for cloud task scheduling problem, which aims to minimize makespan of executing a number tasks on different Virtual Machines (VMs). This method is based on Bumble Bee Mating Optimization (BBMO) algorithm. BBMO is powered by the features of swarm intelligence and local search algorithms. The performance of BBMO is compared to two existing algorithms, Honey Bee Mating Optimization (HBMO) algorithm and Genetic Algorithm (GA). Finally, we analyze the performance of the proposed algorithm with other two algorithms using different scenarios of experiments. The results show that the proposed algorithm (BBMO) outperforms other algorithms.","PeriodicalId":398815,"journal":{"name":"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Task Scheduling in Cloud Computing Environment Using Bumble Bee Mating Algorithm\",\"authors\":\"Mohammad Alotaibi, Mohammad S. Almalag, Kyle Werntz\",\"doi\":\"10.1109/GCAIoT51063.2020.9345824\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Tasks scheduling in cloud computing environment plays an important role for both Cloud Service Providers (CSPs) and the users of the services provided. Therefore, designing an efficient task scheduling algorithm, which fulfill the requirements of CSPs and their clients is essential. Several scheduling algorithms are proposed by various researchers for task scheduling in cloud computing environments. This paper introduces an alternative method for cloud task scheduling problem, which aims to minimize makespan of executing a number tasks on different Virtual Machines (VMs). This method is based on Bumble Bee Mating Optimization (BBMO) algorithm. BBMO is powered by the features of swarm intelligence and local search algorithms. The performance of BBMO is compared to two existing algorithms, Honey Bee Mating Optimization (HBMO) algorithm and Genetic Algorithm (GA). Finally, we analyze the performance of the proposed algorithm with other two algorithms using different scenarios of experiments. The results show that the proposed algorithm (BBMO) outperforms other algorithms.\",\"PeriodicalId\":398815,\"journal\":{\"name\":\"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCAIoT51063.2020.9345824\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Global Conference on Artificial Intelligence and Internet of Things (GCAIoT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCAIoT51063.2020.9345824","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

云计算环境下的任务调度对云服务提供商(csp)和所提供服务的用户都起着重要的作用。因此,设计一种高效的任务调度算法,满足云服务提供商及其客户端的需求是至关重要的。针对云计算环境下的任务调度问题,研究者们提出了多种调度算法。本文介绍了一种解决云任务调度问题的替代方法,该方法旨在最小化在不同虚拟机上执行多个任务的最大时间跨度。该方法基于大黄蜂交配优化(BBMO)算法。BBMO由群体智能和本地搜索算法提供支持。并与现有的两种算法——蜜蜂交配优化算法(HBMO)和遗传算法(GA)进行了性能比较。最后,通过不同的实验场景,对比分析了该算法与其他两种算法的性能。结果表明,该算法(BBMO)优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Task Scheduling in Cloud Computing Environment Using Bumble Bee Mating Algorithm
Tasks scheduling in cloud computing environment plays an important role for both Cloud Service Providers (CSPs) and the users of the services provided. Therefore, designing an efficient task scheduling algorithm, which fulfill the requirements of CSPs and their clients is essential. Several scheduling algorithms are proposed by various researchers for task scheduling in cloud computing environments. This paper introduces an alternative method for cloud task scheduling problem, which aims to minimize makespan of executing a number tasks on different Virtual Machines (VMs). This method is based on Bumble Bee Mating Optimization (BBMO) algorithm. BBMO is powered by the features of swarm intelligence and local search algorithms. The performance of BBMO is compared to two existing algorithms, Honey Bee Mating Optimization (HBMO) algorithm and Genetic Algorithm (GA). Finally, we analyze the performance of the proposed algorithm with other two algorithms using different scenarios of experiments. The results show that the proposed algorithm (BBMO) outperforms other algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信