首页 | 本学科首页   官方微博 | 高级检索  
     

基于组合双向拍卖的云资源调度方法
引用本文:毛莺池,郝帅,平萍,戚荣志.基于组合双向拍卖的云资源调度方法[J].计算机应用,2019,39(1):1-7.
作者姓名:毛莺池  郝帅  平萍  戚荣志
作者单位:河海大学计算机与信息学院,南京,211100;河海大学计算机与信息学院,南京,211100;河海大学计算机与信息学院,南京,211100;河海大学计算机与信息学院,南京,211100
基金项目:“十三五”国家重点研发计划项目(2018YFC0407905,2018YFC0407105,2016YFC0400910);中央高校业务费资助项目(2017B16814,2017B20914);华能集团重点研发项目(HNKJ17-21)。
摘    要:针对跨数据中心的资源调度问题,提出了一种基于组合双向拍卖(PCDA)的资源调度方案。首先,将云资源拍卖分为三个部分:云用户代理报价、云资源提供商要价、拍卖代理组织拍卖;其次,在定义用户的优先级及任务紧迫度的基础上,在拍卖过程中估算每一个工作发生的服务等级协议(SLA)违规并以此计算云提供商的收益,同时每轮竞拍允许成交多项交易;最终达到根据用户等级合理分配云资源调度的效果。仿真实验结果表明该算法保证了竞拍成功率,与传统一次拍卖成交一项的组合双向拍卖方案相比,PCDA在竞拍时间段产生的能耗降低了35.00%,拍卖云提供商的利润提高了约38.84%。

关 键 词:能耗  容器即服务  资源调度  稳定匹配  组合双向拍卖
收稿时间:2018-07-19
修稿时间:2018-08-08

Cloud resource scheduling method based on combinatorial double auction
MAO Yingchi,HAO Shuai,PING Ping,QI Rongzhi.Cloud resource scheduling method based on combinatorial double auction[J].journal of Computer Applications,2019,39(1):1-7.
Authors:MAO Yingchi  HAO Shuai  PING Ping  QI Rongzhi
Affiliation:College of Computer and Information, Hohai University, Nanjing Jiangsu 211100, China
Abstract:Aiming at the resource scheduling problem across data centers, a Priority Combinatorial Double Auction (PCDA) resource scheduling scheme was proposed. Firstly, cloud resource auction was divided into three parts:cloud user agent bidding, cloud resource provider bid, auction agent organization auction. Secondly, on the basis of defining user priority and task urgency, the violation of Service Level Agreement (SLA) of each job during auction was estimated and the revenue of cloud provider was calculated. At the same time, a number of transactions were allowed in each round of bidders. Finally, reasonable allocation of cloud resource scheduling according to user level could be achieved. The simulation results show that the algorithm guarantees the success rate of auction. Compared with traditional auction, PCDA reduces energy consumption by 35.00% and the profit of auction cloud provider is about 38.84%.
Keywords:energy consumption                                                                                                                        Container as a Service (CaaS)                                                                                                                        resource scheduling                                                                                                                        stable matching                                                                                                                        combinatorial double auction
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号