首页> 外文期刊>Future generation computer systems >Semi-online task assignment policies for workload consolidation in cloud computing systems
【24h】

Semi-online task assignment policies for workload consolidation in cloud computing systems

机译:半在线任务分配策略,用于云计算系统中的工作负载合并

获取原文
获取原文并翻译 | 示例
       

摘要

Satisfying on-demand access to cloud computing infrastructures under quality-of-service constraints while minimising the wastage of resources is an important challenge in data centre resource management. In this paper we tackle this challenge in a semi-online workload management system allocating tasks with uncertain duration to physical servers. Our semi-online framework, based on a bin packing approach, allows us to gather information on incoming tasks during a short time window before deciding on their assignments. Our contributions are as follows: (i) we propose a formal framework capturing the semi-online consolidation problem; (ii) we propose a new dynamic and real-time allocation algorithm based on the incremental merging of bins; and (iii) an adaptation of standard bin packing heuristics with a local search algorithm for the semi-online context considered here. We provide a systematic study of the impact of varying time-period size and varying the degrees of uncertainty on the duration of incoming tasks. The policies are compared in terms of solution quality and solving time on a data-set extracted from a real-world cluster trace.Our results show that, around periods of high demand, our best policy saves up to 40% of the resources compared to the other polices, and is robust to uncertainty in the task durations. Finally, we show that small increases in the allowable time window allows a significant improvement, but that larger time windows do not necessarily improve resource usage for real world datasets.
机译:在服务质量约束下满足按需访问云计算基础架构,同时最大程度地减少资源浪费是数据中心资源管理中的一项重要挑战。在本文中,我们在半在线工作负载管理系统中解决了这一挑战,该系统将不确定持续时间的任务分配给物理服务器。我们的半在线框架基于bin打包方法,允许我们在确定任务分配之前的很短时间内收集有关传入任务的信息。我们的贡献如下:(i)我们提出了一个解决半在线合并问题的正式框架; (ii)我们提出了一种基于增量合并合并的新的动态和实时分配算法; (iii)针对此处考虑的半在线上下文,使用本地搜索算法对标准bin打包试探法进行调整。我们提供了一个系统的研究,研究了不同时间段大小和不确定程度对传入任务持续时间的影响。从解决方案的质量和解决时间上对策略进行了比较,这些数据集是从真实集群追踪中提取的数据集。我们的结果表明,在需求旺盛的时期,我们的最佳策略可以节省多达40%的资源。其他策略,并且对任务持续时间的不确定性具有鲁棒性。最后,我们表明,允许的时间窗口中的小幅增加可以带来显着的改善,但是更大的时间窗口并不一定会改善现实世界数据集的资源使用情况。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号