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

被引:15
作者
Armant, Vincent [1 ]
De Cauwer, Milan [1 ]
Brown, Kenneth N. [1 ]
O'Sullivan, Barry [1 ]
机构
[1] Univ Coll Cork, Dept Comp Sci, Insight Ctr Data Analyt, Cork, Ireland
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2018年 / 82卷
基金
爱尔兰科学基金会;
关键词
Cloud computing; Workload consolidation; Semi-online policies; Stochastic task duration; SERVER CONSOLIDATION; MIGRATION;
D O I
10.1016/j.future.2017.12.035
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:89 / 103
页数:15
相关论文
共 26 条
[21]  
Pires F. L., 2015, VIRTUAL MACHINE PLAC
[22]  
Shehabi A., 2016, LBNL1005775
[23]   Online stochastic optimization under time constraints [J].
Van Hentenryck, Pascal ;
Bent, Russell ;
Upfal, Eli .
ANNALS OF OPERATIONS RESEARCH, 2010, 177 (01) :151-183
[24]   More than bin packing: Dynamic resource allocation strategies in cloud data centers [J].
Wolke, Andreas ;
Tsend-Ayush, Boldbaatar ;
Pfeiffer, Carl ;
Bichler, Martin .
INFORMATION SYSTEMS, 2015, 52 :83-95
[25]  
Wu G, 2012, LECT NOTES COMPUT SC, V7665, P315, DOI 10.1007/978-3-642-34487-9_39
[26]  
Yufan Ho, 2011, Proceedings of the 2011 IEEE 4th International Conference on Utility and Cloud Computing (UCC 2011), P154, DOI 10.1109/UCC.2011.30