多云系统中考虑SLA的竞价资源发放

Chi-Chung Chang, Kuan-Chou Lai, Chao-Tung Yang
{"title":"多云系统中考虑SLA的竞价资源发放","authors":"Chi-Chung Chang, Kuan-Chou Lai, Chao-Tung Yang","doi":"10.1109/COMPSACW.2013.69","DOIUrl":null,"url":null,"abstract":"Efficient resource provisioning and allocation enable the reduction of energy consumption in cloud providers and make providers to get more profits. When the client submits more and more jobs to a cloud provider, the available resources in a cloud provider may not be enough for completing these jobs. Therefore, the cloud providers have to lease more available resources from others. In order to solve this problem, this study proposes a combinatorial auction-based approach for dynamic resource provisioning and allocation, considering the client requests with deadline. Experimental results show that our proposed auction-based approach could get more profit.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Auction-Based Resource Provisioning with SLA Consideration on Multi-cloud Systems\",\"authors\":\"Chi-Chung Chang, Kuan-Chou Lai, Chao-Tung Yang\",\"doi\":\"10.1109/COMPSACW.2013.69\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient resource provisioning and allocation enable the reduction of energy consumption in cloud providers and make providers to get more profits. When the client submits more and more jobs to a cloud provider, the available resources in a cloud provider may not be enough for completing these jobs. Therefore, the cloud providers have to lease more available resources from others. In order to solve this problem, this study proposes a combinatorial auction-based approach for dynamic resource provisioning and allocation, considering the client requests with deadline. Experimental results show that our proposed auction-based approach could get more profit.\",\"PeriodicalId\":152957,\"journal\":{\"name\":\"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMPSACW.2013.69\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSACW.2013.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

高效的资源配置和分配可以降低云提供商的能源消耗,使提供商获得更多的利润。当客户端向云提供商提交越来越多的作业时,云提供商中的可用资源可能不足以完成这些作业。因此,云提供商必须从其他人那里租用更多可用资源。为了解决这一问题,本研究提出了一种基于组合拍卖的动态资源配置与分配方法,并考虑了客户的截止日期要求。实验结果表明,我们提出的基于拍卖的方法可以获得更高的利润。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Auction-Based Resource Provisioning with SLA Consideration on Multi-cloud Systems
Efficient resource provisioning and allocation enable the reduction of energy consumption in cloud providers and make providers to get more profits. When the client submits more and more jobs to a cloud provider, the available resources in a cloud provider may not be enough for completing these jobs. Therefore, the cloud providers have to lease more available resources from others. In order to solve this problem, this study proposes a combinatorial auction-based approach for dynamic resource provisioning and allocation, considering the client requests with deadline. Experimental results show that our proposed auction-based approach could get more profit.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Patrol Guidance Mechanism in a Context-Aware Environment Investigating the Relevance of Linked Open Data Sets with SPARQL Queries A Distributed Protective Approach for Multiechelon Supply Systems Model Checking for SpaceWire Link Interface Design Using Uppaal An Optimal Route Selection Mechanism for Outbound Connection on IPv6 Site Multihoming Environment
×
引用
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