咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >A preemptive truthful VMs allo... 收藏

A preemptive truthful VMs allocation online mechanism in private cloud

抢先式的诚实 VM 分配在私人云的联机机制

作     者:Gu, Yonggen Tao, Jie Li, Guoqiang Sun, Daniel W. Wu, Xiaohong Jayaraman, Prem Prakash Ranjan, Rajiv 

作者机构:Huzhou Univ Sch Informat Engn Huzhou Peoples R China Shanghai Jiao Tong Univ Sch Software Shanghai Peoples R China CSIRO Data61 Canberra ACT Australia Univ New South Wales Sch Comp Sci & Engn Sydney NSW Australia Shanghai Univ Finance & Econ Shanghai Peoples R China RMIT Melbourne Vic Australia Chinese Univ Geosci Wuhan Peoples R China Newcastle Univ Sch Comp Sci Newcastle Upon Tyne Tyne & Wear England 

出 版 物:《JOURNAL OF COMPUTATIONAL SCIENCE》 (计算科学杂志)

年 卷 期:2016年第17卷第Part3期

页      面:647-653页

核心收录:

学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)] 

基  金:National Natural Science Foundation of China [61170029, 61472240, 61373032] Zhejiang Provincial Science and Technology Plan of China [2013C31097] 

主  题:Cloud computing Preemptive allocation Online algorithm Truthfulness Competitive ratio 

摘      要:During the last decade, cloud-technology has presented considerable opportunities for high-performance computing (HPC). In addition, technical computing data centers have been able to maximize their return on investment (ROI). HPC system managers can leverage the benefits of a cloud model for their traditional HPC environments to improve scalability, simplify service access, accelerate collaboration or funding, enable pay-for-use, and improve efficiency. Many HPC clouds assume the form of private Infrastructure as a Service (IaaS). In practice, private cloud users may strategically misreport task values in order to achieve a high profit, and thus cloud providers cannot simply maximize the sum of allocatedusers value, which is called social welfare. For this reason, designing a mechanism that reveals the truthful value of users with a concern for both random arrival tasks and maximizing social welfare is necessary. In this study, a model of an online mechanism for virtual machines allocation is built, a preemptive online mechanism is proposed, the truthfulness is proved, a competitive ratio is given, and several simulations are conducted using real tasks from a data center. The total values and completed tasks are compared to the online and offline allocations, respectively, according to different capacity. The simulations reveal that our mechanism is more efficient than the offline mechanism. (C) 2016 Published by Elsevier B.V.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分