Heuristics for Efficient Resource Allocation in Cloud Computing

S. Yang, Nong Ye
{"title":"Heuristics for Efficient Resource Allocation in Cloud Computing","authors":"S. Yang, Nong Ye","doi":"10.36811/rjcse.2019.110001","DOIUrl":null,"url":null,"abstract":"The resource allocation in cloud computing determines the allocation of computer and network resources of service providers to service requests of users for meeting user service requirements. It is not scalable to solve the resource allocation problem as an optimization problem to obtain the optimal solution in real time. This paper presents the development and testing of heuristics for the efficient resource allocation to obtain near-optimal solutions in a scalable manner. We first define the resource allocation problem as a Mixed Integer rogramming (MIP) optimization problem and obtain the optimal solutions for various resource-service problem types. Based on the analysis of the optimal solutions, we design heuristics for the efficient resource allocation. Then we evaluate the performance of the resource allocation heuristics using various resource-service problem types and different numbers of service requests and resources. The results show the comparable performance of the heuristics to the optimal solutions. The resource allocation heuristics also demonstrate the better computational efficiency and thus scalability than solving the MIP problems to obtain the optimal solutions.\n\nKeywords: Resource allocation; Clouds computing; Heuristics; Mixed integer programming","PeriodicalId":115801,"journal":{"name":"Research Journal of Computer Science and Engineering","volume":"4 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Research Journal of Computer Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36811/rjcse.2019.110001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The resource allocation in cloud computing determines the allocation of computer and network resources of service providers to service requests of users for meeting user service requirements. It is not scalable to solve the resource allocation problem as an optimization problem to obtain the optimal solution in real time. This paper presents the development and testing of heuristics for the efficient resource allocation to obtain near-optimal solutions in a scalable manner. We first define the resource allocation problem as a Mixed Integer rogramming (MIP) optimization problem and obtain the optimal solutions for various resource-service problem types. Based on the analysis of the optimal solutions, we design heuristics for the efficient resource allocation. Then we evaluate the performance of the resource allocation heuristics using various resource-service problem types and different numbers of service requests and resources. The results show the comparable performance of the heuristics to the optimal solutions. The resource allocation heuristics also demonstrate the better computational efficiency and thus scalability than solving the MIP problems to obtain the optimal solutions. Keywords: Resource allocation; Clouds computing; Heuristics; Mixed integer programming
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
云计算中资源高效分配的启发式方法
云计算中的资源分配决定了服务提供商将计算机和网络资源分配给用户的服务请求,以满足用户的业务需求。将资源分配问题作为优化问题来解决,以获得实时的最优解,是不可伸缩的。本文提出了有效资源分配的启发式方法的开发和测试,以获得可扩展的近似最优解。首先将资源分配问题定义为一个混合整数规划(MIP)优化问题,得到了各种类型资源服务问题的最优解。在分析最优解的基础上,设计了资源有效分配的启发式算法。然后,我们使用各种资源服务问题类型和不同数量的服务请求和资源来评估资源分配启发式算法的性能。结果表明,启发式算法的性能与最优解相当。资源分配启发式方法比求解MIP问题具有更好的计算效率和可扩展性,从而获得最优解。关键词:资源配置;云计算;启发式;混合整数规划
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Heuristics for Efficient Resource Allocation in Cloud Computing
×
引用
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