A chameleon and remora search optimization algorithm for handling task scheduling uncertainty problem in cloud computing

IF 3.8 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Sustainable Computing-Informatics & Systems Pub Date : 2023-11-30 DOI:10.1016/j.suscom.2023.100944
P. Pabitha , K. Nivitha , C. Gunavathi , B. Panjavarnam
{"title":"A chameleon and remora search optimization algorithm for handling task scheduling uncertainty problem in cloud computing","authors":"P. Pabitha ,&nbsp;K. Nivitha ,&nbsp;C. Gunavathi ,&nbsp;B. Panjavarnam","doi":"10.1016/j.suscom.2023.100944","DOIUrl":null,"url":null,"abstract":"<div><p><span><span>Task scheduling in </span>cloud computing is responsible for serving the user requirements. The scheduling strategy must handle the problems of high load over virtual machines (VMs), high-cost consumption and lengthier scheduling time effectively. The greatest challenge in the cloud computing environment is achieving the intended outcome of task scheduling under the uncertain user request demands as it is responsible for assigning specific resources to requests for achieving effective task completion. However, most of the task scheduling approaches contributed to the literature mainly focused on the design and development of </span>scheduling algorithms<span> but ignored to explore the impact of uncertain factors such as millions of instructions per second<span><span> (MIPS) and network bandwidth during the scheduling process. In this paper, A Chameleon and Remora Search </span>Optimization Algorithm<span><span> (CRSOA) is proposed for achieving efficient scheduling process by exploring the impact of MIPS and network bandwidth which directly affects the virtual machine (VM) performance. Further the work includes the uncertainty factors of task completion rate, load balance, scheduling cost and makespan in a simultaneous manner during the process of scheduling. It is formulated a multi-objective cloud task scheduling optimization model by integrating the merits of Chameleon Search Algorithm (CSA) and Remora Search Optimization Algorithm (RSOA) using a greedy methodology for simulating the real cloud computing task scheduling process. The simulation results evidently confirmed that the proposed CRSOA approach is minimizing the completion time and effective in handling the load balancing between the available VMs against other competitive </span>metaheuristic task scheduling algorithms. The experimental investigation of this CRSOA confirmed its predominance in minimizing the makespan by 18.96%, cost by 22.18%, and degree of imbalance by 20.54%, compared to the baseline approaches with different number of tasks and VMs.</span></span></span></p></div>","PeriodicalId":48686,"journal":{"name":"Sustainable Computing-Informatics & Systems","volume":"41 ","pages":"Article 100944"},"PeriodicalIF":3.8000,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sustainable Computing-Informatics & Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210537923000999","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Task scheduling in cloud computing is responsible for serving the user requirements. The scheduling strategy must handle the problems of high load over virtual machines (VMs), high-cost consumption and lengthier scheduling time effectively. The greatest challenge in the cloud computing environment is achieving the intended outcome of task scheduling under the uncertain user request demands as it is responsible for assigning specific resources to requests for achieving effective task completion. However, most of the task scheduling approaches contributed to the literature mainly focused on the design and development of scheduling algorithms but ignored to explore the impact of uncertain factors such as millions of instructions per second (MIPS) and network bandwidth during the scheduling process. In this paper, A Chameleon and Remora Search Optimization Algorithm (CRSOA) is proposed for achieving efficient scheduling process by exploring the impact of MIPS and network bandwidth which directly affects the virtual machine (VM) performance. Further the work includes the uncertainty factors of task completion rate, load balance, scheduling cost and makespan in a simultaneous manner during the process of scheduling. It is formulated a multi-objective cloud task scheduling optimization model by integrating the merits of Chameleon Search Algorithm (CSA) and Remora Search Optimization Algorithm (RSOA) using a greedy methodology for simulating the real cloud computing task scheduling process. The simulation results evidently confirmed that the proposed CRSOA approach is minimizing the completion time and effective in handling the load balancing between the available VMs against other competitive metaheuristic task scheduling algorithms. The experimental investigation of this CRSOA confirmed its predominance in minimizing the makespan by 18.96%, cost by 22.18%, and degree of imbalance by 20.54%, compared to the baseline approaches with different number of tasks and VMs.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种处理云计算中任务调度不确定性问题的变色龙搜索优化算法
云计算中的任务调度负责满足用户需求。调度策略必须有效地解决虚拟机高负载、高开销和调度时间长的问题。云计算环境中最大的挑战是在不确定的用户请求需求下实现任务调度的预期结果,因为它负责为请求分配特定的资源,以实现有效的任务完成。然而,文献中的大多数任务调度方法主要集中在调度算法的设计和开发上,而忽略了对调度过程中百万指令秒(MIPS)和网络带宽等不确定因素的影响的探讨。本文通过探索直接影响虚拟机性能的MIPS和网络带宽的影响,提出了一种变色龙和remoa搜索优化算法(CRSOA)来实现高效的调度过程。同时考虑了调度过程中任务完成率、负载均衡、调度成本和最大完工时间等不确定性因素。结合变色龙搜索算法(CSA)和remoa搜索优化算法(RSOA)的优点,采用贪心方法模拟真实的云计算任务调度过程,建立了多目标云任务调度优化模型。仿真结果表明,与其他具有竞争力的元启发式任务调度算法相比,所提出的CRSOA方法能够最大限度地缩短任务完成时间,有效地处理可用虚拟机之间的负载均衡问题。对该CRSOA的实验研究证实,与具有不同任务和虚拟机数量的基准方法相比,该方法在最大完工时间减少18.96%、成本减少22.18%、不平衡程度减少20.54%方面具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Sustainable Computing-Informatics & Systems
Sustainable Computing-Informatics & Systems COMPUTER SCIENCE, HARDWARE & ARCHITECTUREC-COMPUTER SCIENCE, INFORMATION SYSTEMS
CiteScore
10.70
自引率
4.40%
发文量
142
期刊介绍: Sustainable computing is a rapidly expanding research area spanning the fields of computer science and engineering, electrical engineering as well as other engineering disciplines. The aim of Sustainable Computing: Informatics and Systems (SUSCOM) is to publish the myriad research findings related to energy-aware and thermal-aware management of computing resource. Equally important is a spectrum of related research issues such as applications of computing that can have ecological and societal impacts. SUSCOM publishes original and timely research papers and survey articles in current areas of power, energy, temperature, and environment related research areas of current importance to readers. SUSCOM has an editorial board comprising prominent researchers from around the world and selects competitively evaluated peer-reviewed papers.
期刊最新文献
Editorial Board Secured and energy efficient cluster based routing in WSN via hybrid optimization model, TICOA Multiobjective hybrid Al-Biruni Earth Namib Beetle Optimization and deep learning based task scheduling in cloud computing Analysing the radiation reliability, performance and energy consumption of low-power SoC through heterogeneous parallelism Nearest data processing in GPU
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1