当前位置: X-MOL 学术IEEE Trans. Serv. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An Instance Reservation Framework for Cost Effective Services in Geo-Distributed Data Centers
IEEE Transactions on Services Computing ( IF 5.5 ) Pub Date : 2018-03-22 , DOI: 10.1109/tsc.2018.2818121
Kaiyang Liu , Jun Peng , Boyang Yu , Weirong Liu , Zhiwu Huang , Jianping Pan

Infrastructure-as-a-Service clouds in geo-distributed data centers offer various pricing options, including on-demand and reserved instances, which provide an elastic and cost-effective infrastructure to support High Performance Computing (HPC) applications. In this paper, we propose an instance reservation based cloud service framework, modeling the cost-minimizing reservation decision issue as an NP-hard integer programming problem for distributed data centers. To ease its computation complexity, two algorithms are proposed to minimize the HPC service cost with the worst-case performance guarantees: an offline heuristic-greedy algorithm, and a rolling-horizon based online algorithm when only short-term demand prediction is available. Facing fluctuating demands, instance reservation in a single data center may incur the highly underutilized capacity. To address this issue for further cost reduction, we extend the scheme with a novel cloud broker federation based resource sharing mechanism, reallocating already reserved but unused instances to computation-intensive and short-lived tasks for continuous execution without interruption. Extensive evaluations driven by large-scale trace-based datasets demonstrate that the proposed mechanism can effectively handle large volumes of service requests, saving considerable service costs with higher reservation resource utilization.

中文翻译:

地理分布式数据中心中具有成本效益的服务的实例预留框架

地理分布数据中心中的基础架构即服务云提供了各种定价选项,包括按需实例和预留实例,它们提供了一种弹性且具有成本效益的基础架构来支持高性能计算(HPC)应用程序。在本文中,我们提出了一个基于实例预留的云服务框架,将最小化成本的预留决策问题建模为分布式数据中心的NP硬整数规划问题。为了缓解其计算复杂性,提出了两种算法以在最坏情况下保证性能,以最大程度地降低HPC服务成本:离线启发式贪婪算法和仅在短期需求预测可用时基于滚动水平的在线算法。面对不断变化的需求,单个数据中心中的实例预留可能会导致高度未充分利用的容量。为了解决此问题以进一步降低成本,我们使用基于云代理联合的新颖资源共享机制扩展了该方案,将已经保留但未使用的实例重新分配给计算密集型和短暂任务,以实现不间断的连续执行。由大规模基于跟踪的数据集进行的广泛评估表明,该机制可以有效处理大量服务请求,并通过更高的预留资源利用率来节省可观的服务成本。将已经保留但未使用的实例重新分配给计算量大和寿命短的任务,以便在不中断的情况下连续执行。由大规模基于跟踪的数据集进行的广泛评估表明,该机制可以有效处理大量服务请求,并通过更高的预留资源利用率来节省可观的服务成本。将已经保留但未使用的实例重新分配给计算量大和寿命短的任务,以便在不中断的情况下连续执行。由大规模基于跟踪的数据集进行的广泛评估表明,该机制可以有效处理大量服务请求,并通过更高的预留资源利用率来节省可观的服务成本。
更新日期:2018-03-22
down
wechat
bug