使用蜂群智能技术的云环境负载平衡模型

IF 0.6 Q4 COMPUTER SCIENCE, THEORY & METHODS
G. Verma, Soumen Kanrar
{"title":"使用蜂群智能技术的云环境负载平衡模型","authors":"G. Verma, Soumen Kanrar","doi":"10.3233/mgs-230021","DOIUrl":null,"url":null,"abstract":"A distributed system with a shared resource pool offers cloud computing services. According to the provider’s policy, customers can enjoy continuous access to these resources. Every time a job is transferred to the cloud to be carried out, the environment must be appropriately planned. A sufficient number of virtual machines (VM) must be accessible on the backend to do this. As a result, the scheduling method determines how well the system functions. An intelligent scheduling algorithm distributes the jobs among all VMs to balance the overall workload. This problem falls into the category of NP-Hard problems and is regarded as a load balancing problem. With spider monkey optimization, we have implemented a fresh strategy for more dependable and efficient load balancing in cloud environments. The suggested optimization strategy aims to boost performance by choosing the least-loaded VM to distribute the workloads. The simulation results clearly show that the proposed algorithm performs better regarding load balancing, reaction time, make span and resource utilization. The experimental results outperform the available approaches.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":"104 8","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Load balancing model for cloud environment using swarm intelligence technique\",\"authors\":\"G. Verma, Soumen Kanrar\",\"doi\":\"10.3233/mgs-230021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A distributed system with a shared resource pool offers cloud computing services. According to the provider’s policy, customers can enjoy continuous access to these resources. Every time a job is transferred to the cloud to be carried out, the environment must be appropriately planned. A sufficient number of virtual machines (VM) must be accessible on the backend to do this. As a result, the scheduling method determines how well the system functions. An intelligent scheduling algorithm distributes the jobs among all VMs to balance the overall workload. This problem falls into the category of NP-Hard problems and is regarded as a load balancing problem. With spider monkey optimization, we have implemented a fresh strategy for more dependable and efficient load balancing in cloud environments. The suggested optimization strategy aims to boost performance by choosing the least-loaded VM to distribute the workloads. The simulation results clearly show that the proposed algorithm performs better regarding load balancing, reaction time, make span and resource utilization. The experimental results outperform the available approaches.\",\"PeriodicalId\":43659,\"journal\":{\"name\":\"Multiagent and Grid Systems\",\"volume\":\"104 8\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Multiagent and Grid Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/mgs-230021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Multiagent and Grid Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/mgs-230021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

具有共享资源池的分布式系统提供云计算服务。根据提供商的政策,客户可以持续访问这些资源。每次将任务转移到云端执行时,都必须对环境进行适当规划。为此,后端必须有足够数量的虚拟机(VM)。因此,调度方法决定了系统功能的好坏。智能调度算法会在所有虚拟机之间分配作业,以平衡整体工作量。这个问题属于 NP-Hard 问题,被视为负载平衡问题。通过蜘蛛猴优化,我们在云环境中实施了一种更可靠、更高效的负载平衡新策略。建议的优化策略旨在通过选择负载最小的虚拟机来分配工作负载,从而提高性能。仿真结果清楚地表明,建议的算法在负载平衡、反应时间、跨度和资源利用率方面表现更佳。实验结果优于现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Load balancing model for cloud environment using swarm intelligence technique
A distributed system with a shared resource pool offers cloud computing services. According to the provider’s policy, customers can enjoy continuous access to these resources. Every time a job is transferred to the cloud to be carried out, the environment must be appropriately planned. A sufficient number of virtual machines (VM) must be accessible on the backend to do this. As a result, the scheduling method determines how well the system functions. An intelligent scheduling algorithm distributes the jobs among all VMs to balance the overall workload. This problem falls into the category of NP-Hard problems and is regarded as a load balancing problem. With spider monkey optimization, we have implemented a fresh strategy for more dependable and efficient load balancing in cloud environments. The suggested optimization strategy aims to boost performance by choosing the least-loaded VM to distribute the workloads. The simulation results clearly show that the proposed algorithm performs better regarding load balancing, reaction time, make span and resource utilization. The experimental results outperform the available approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Multiagent and Grid Systems
Multiagent and Grid Systems COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
1.50
自引率
0.00%
发文量
13
×
引用
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学术官方微信