虚拟机上计算密集型任务分配的优化技术

Akil Uddin Chowdhury, Md. Sazzad Hossen, M. Zahed
{"title":"虚拟机上计算密集型任务分配的优化技术","authors":"Akil Uddin Chowdhury, Md. Sazzad Hossen, M. Zahed","doi":"10.1109/ECCE57851.2023.10101526","DOIUrl":null,"url":null,"abstract":"Currently, the world is moving towards data-driven cloud-based services for diverse applications. In such applications, the user is more willing to request space and computational resources from a virtual machine (VM) rather than investing in building more costly and space-consuming physical machines. This ever-increasing demand for VMs introduces a growing need for optimal task allocations. The goal of this study is to develop a model to allocate user requests for tasks into the least possible number of available VMs. The problem is designed as an integer linear programming (ILP) optimization problem. To solve the problem in a practical time span, a heuristic algorithm is also designed. The simulation results show that the heuristic approach achieves a near-optimal solution for task allocation and eventually leads to reduced setup and operational costs for the service providers.","PeriodicalId":131537,"journal":{"name":"2023 International Conference on Electrical, Computer and Communication Engineering (ECCE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Optimal Technique for Computation-intensive Task Allocation at Virtual Machines\",\"authors\":\"Akil Uddin Chowdhury, Md. Sazzad Hossen, M. Zahed\",\"doi\":\"10.1109/ECCE57851.2023.10101526\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Currently, the world is moving towards data-driven cloud-based services for diverse applications. In such applications, the user is more willing to request space and computational resources from a virtual machine (VM) rather than investing in building more costly and space-consuming physical machines. This ever-increasing demand for VMs introduces a growing need for optimal task allocations. The goal of this study is to develop a model to allocate user requests for tasks into the least possible number of available VMs. The problem is designed as an integer linear programming (ILP) optimization problem. To solve the problem in a practical time span, a heuristic algorithm is also designed. The simulation results show that the heuristic approach achieves a near-optimal solution for task allocation and eventually leads to reduced setup and operational costs for the service providers.\",\"PeriodicalId\":131537,\"journal\":{\"name\":\"2023 International Conference on Electrical, Computer and Communication Engineering (ECCE)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 International Conference on Electrical, Computer and Communication Engineering (ECCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECCE57851.2023.10101526\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Electrical, Computer and Communication Engineering (ECCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECCE57851.2023.10101526","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

目前,世界正朝着为各种应用程序提供基于数据驱动的云服务的方向发展。在这样的应用程序中,用户更愿意从虚拟机(VM)请求空间和计算资源,而不是投资于构建成本更高、占用空间更大的物理机器。对vm不断增长的需求导致对最佳任务分配的需求不断增长。本研究的目标是开发一个模型,将用户对任务的请求分配到尽可能少的可用vm中。该问题被设计为一个整数线性规划(ILP)优化问题。为了在实际时间范围内解决问题,设计了一种启发式算法。仿真结果表明,启发式方法获得了任务分配的近似最优解,并最终降低了服务提供商的设置和运营成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Optimal Technique for Computation-intensive Task Allocation at Virtual Machines
Currently, the world is moving towards data-driven cloud-based services for diverse applications. In such applications, the user is more willing to request space and computational resources from a virtual machine (VM) rather than investing in building more costly and space-consuming physical machines. This ever-increasing demand for VMs introduces a growing need for optimal task allocations. The goal of this study is to develop a model to allocate user requests for tasks into the least possible number of available VMs. The problem is designed as an integer linear programming (ILP) optimization problem. To solve the problem in a practical time span, a heuristic algorithm is also designed. The simulation results show that the heuristic approach achieves a near-optimal solution for task allocation and eventually leads to reduced setup and operational costs for the service providers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Cyclone Prediction Visualization Tools Using Machine Learning Models and Optical Flow Exploratory Perspective of PV Net-Energy-Metering for Residential Prosumers: A Case Study in Dhaka, Bangladesh Estimation of Soil Moisture with Meteorological Variables in Supervised Machine Learning Models Deep CNN-GRU Based Human Activity Recognition with Automatic Feature Extraction Using Smartphone and Wearable Sensors Bengali-English Neural Machine Translation Using Deep Learning Techniques
×
引用
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