基于多目标装箱算法的分布式云资源合理分配

Senthil Kumar Angappan, Tezera Robe, Sisay Muleta, Bekele Worku M
{"title":"基于多目标装箱算法的分布式云资源合理分配","authors":"Senthil Kumar Angappan, Tezera Robe, Sisay Muleta, Bekele Worku M","doi":"10.1108/ijius-05-2021-0032","DOIUrl":null,"url":null,"abstract":"PurposeCloud computing services gained huge attention in recent years and many organizations started moving their business data traditional server to the cloud storage providers. However, increased data storage introduces challenges like inefficient usage of resources in the cloud storage, in order to meet the demands of users and maintain the service level agreement with the clients, the cloud server has to allocate the physical machine to the virtual machines as requested, but the random resource allocations procedures lead to inefficient utilization of resources.Design/methodology/approachThis thesis focuses on resource allocation for reasonable utilization of resources. The overall framework comprises of cloudlets, broker, cloud information system, virtual machines, virtual machine manager, and data center. Existing first fit and best fit algorithms consider the minimization of the number of bins but do not consider leftover bins.FindingsThe proposed algorithm effectively utilizes the resources compared to first, best and worst fit algorithms. The effect of this utilization efficiency can be seen in metrics where central processing unit (CPU), bandwidth (BW), random access memory (RAM) and power consumption outperformed very well than other algorithms by saving 15 kHz of CPU, 92.6kbps of BW, 6GB of RAM and saved 3kW of power compared to first and best fit algorithms.Originality/valueThe proposed multi-objective bin packing algorithm is better for packing VMs on physical servers in order to better utilize different parameters such as memory availability, CPU speed, power and bandwidth availability in the physical machine.","PeriodicalId":42876,"journal":{"name":"International Journal of Intelligent Unmanned Systems","volume":" ","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed cloud resources allocation for fair utilization using multi-objective bin packing algorithm\",\"authors\":\"Senthil Kumar Angappan, Tezera Robe, Sisay Muleta, Bekele Worku M\",\"doi\":\"10.1108/ijius-05-2021-0032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"PurposeCloud computing services gained huge attention in recent years and many organizations started moving their business data traditional server to the cloud storage providers. However, increased data storage introduces challenges like inefficient usage of resources in the cloud storage, in order to meet the demands of users and maintain the service level agreement with the clients, the cloud server has to allocate the physical machine to the virtual machines as requested, but the random resource allocations procedures lead to inefficient utilization of resources.Design/methodology/approachThis thesis focuses on resource allocation for reasonable utilization of resources. The overall framework comprises of cloudlets, broker, cloud information system, virtual machines, virtual machine manager, and data center. Existing first fit and best fit algorithms consider the minimization of the number of bins but do not consider leftover bins.FindingsThe proposed algorithm effectively utilizes the resources compared to first, best and worst fit algorithms. The effect of this utilization efficiency can be seen in metrics where central processing unit (CPU), bandwidth (BW), random access memory (RAM) and power consumption outperformed very well than other algorithms by saving 15 kHz of CPU, 92.6kbps of BW, 6GB of RAM and saved 3kW of power compared to first and best fit algorithms.Originality/valueThe proposed multi-objective bin packing algorithm is better for packing VMs on physical servers in order to better utilize different parameters such as memory availability, CPU speed, power and bandwidth availability in the physical machine.\",\"PeriodicalId\":42876,\"journal\":{\"name\":\"International Journal of Intelligent Unmanned Systems\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2021-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Unmanned Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1108/ijius-05-2021-0032\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ROBOTICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Unmanned Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ijius-05-2021-0032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 0

摘要

目的云计算服务近年来获得了巨大的关注,许多组织开始将其业务数据的传统服务器转移到云存储提供商。然而,数据存储的增加带来了云存储资源的低效利用等挑战,为了满足用户的需求和维护与客户端的服务水平协议,云服务器必须根据请求将物理机分配给虚拟机,但随机的资源分配过程导致资源的低效利用。设计/方法/方法本文的重点是资源分配,以合理利用资源。整个框架由cloudlets、代理、云信息系统、虚拟机、虚拟机管理器和数据中心组成。现有的首次拟合和最佳拟合算法考虑最小化箱子的数量,但不考虑剩余的箱子。结果与第一拟合算法、最佳拟合算法和最差拟合算法相比,该算法有效地利用了资源。这种利用效率的效果可以从中央处理单元(CPU)、带宽(BW)、随机存取存储器(RAM)和功耗的指标中看到,与第一种和最适合的算法相比,它节省了15 kHz的CPU、92.6kbps的BW、6GB的RAM和3kW的功耗,比其他算法表现得更好。提出的多目标装箱算法更适合在物理服务器上打包vm,以便更好地利用物理机器中的不同参数,如内存可用性、CPU速度、功率和带宽可用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Distributed cloud resources allocation for fair utilization using multi-objective bin packing algorithm
PurposeCloud computing services gained huge attention in recent years and many organizations started moving their business data traditional server to the cloud storage providers. However, increased data storage introduces challenges like inefficient usage of resources in the cloud storage, in order to meet the demands of users and maintain the service level agreement with the clients, the cloud server has to allocate the physical machine to the virtual machines as requested, but the random resource allocations procedures lead to inefficient utilization of resources.Design/methodology/approachThis thesis focuses on resource allocation for reasonable utilization of resources. The overall framework comprises of cloudlets, broker, cloud information system, virtual machines, virtual machine manager, and data center. Existing first fit and best fit algorithms consider the minimization of the number of bins but do not consider leftover bins.FindingsThe proposed algorithm effectively utilizes the resources compared to first, best and worst fit algorithms. The effect of this utilization efficiency can be seen in metrics where central processing unit (CPU), bandwidth (BW), random access memory (RAM) and power consumption outperformed very well than other algorithms by saving 15 kHz of CPU, 92.6kbps of BW, 6GB of RAM and saved 3kW of power compared to first and best fit algorithms.Originality/valueThe proposed multi-objective bin packing algorithm is better for packing VMs on physical servers in order to better utilize different parameters such as memory availability, CPU speed, power and bandwidth availability in the physical machine.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.50
自引率
0.00%
发文量
21
期刊最新文献
Design of hexacopter and finite element analysis for material selection Towards a novel cyber physical control system framework: a deep learning driven use case Employing a multi-sensor fusion array to detect objects for an orbital transfer vehicle to remove space debris Communication via quad/hexa-copters during disasters Nonlinear optimal control for UAVs with tilting rotors
×
引用
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