A Self-Optimized Generic Workload Prediction Framework for Cloud Computing

被引:12
作者
Jayakumar, Vinodh Kumaran [1 ]
Lee, Jaewoo [2 ]
Kim, In Kee [2 ]
Wang, Wei [1 ]
机构
[1] Univ Texas San Antonio, Dept Comp Sci, San Antonio, TX 78249 USA
[2] Univ Georgia, Dept Comp Sci, Athens, GA 30602 USA
来源
2020 IEEE 34TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM IPDPS 2020 | 2020年
关键词
Cloud Computing; Workload Prediction; Long Short-Term Memory; Self-Optimized Framework; Resource Management;
D O I
10.1109/IPDPS47924.2020.00085
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The accurate prediction of the future workload, such as the job arrival rate and the user request rate, is critical to the efficiency of resource management and elasticity in the cloud. However, designing a generic workload predictor that works properly for various types of workload is very challenging due to the large variety of workload patterns and the dynamic changes within a workload. Because of these challenges, existing workload predictors are usually hand-tuned for specific (types of) workloads for maximum accuracy. This necessity to individually tune the predictors also makes it very difficult to reproduce the results from prior research, as the predictor designs have a strong dependency on the workloads. In this paper, we present a novel generic workload prediction framework, LoadDynamics, that can provide high accuracy predictions for any workloads. LoadDynamics employs Long-Short-Term-Memory models and can automatically optimize its internal parameters for an individual workload to achieve high prediction accuracy. We evaluated LoadDynamics with a mixture of workload traces representing public cloud applications, scientific applications, data center jobs and web applications. The evaluation results show that LoadDynamics have only 18% prediction error on average, which is at least 6.7% lower than state-of-the-art workload prediction techniques. The error of LoadDynamics was also only 1% higher than the best predictor found by exhaustive search for each workload. When applied in the Google Cloud, LoadDynamics-enabled auto-scaling policy also outperformed the state-of-the-art predictors by reducing the job turnaround time by at least 24.6% and reducing virtual machine over-provisioning by at least 4.8%.
引用
收藏
页码:779 / 788
页数:10
相关论文
共 56 条
[1]  
Aniruddha G., 2011, 2011 IEEE 4 INT C CL, P500, DOI DOI 10.1109/CLOUD.2011.42
[2]  
[Anonymous], IFIP IEEE INT S INT
[3]  
[Anonymous], 2012, Future Generation Computer Systems, DOI DOI 10.1016/J.FUTURE.2011.05.027
[4]  
[Anonymous], CLUSTER COMPUTING
[5]  
[Anonymous], IEEE INT C SERV COMP
[6]  
[Anonymous], INT C ARCH SUPP PROG
[7]  
Baig Shuja ur Rehman, 2019, IEEE T NETWORK SERVI
[8]  
Bergstra J., 2011, Advances in Neural Information Processing Systems, V24, P2546
[9]  
Bergstra J, 2012, J MACH LEARN RES, V13, P281
[10]  
Bi Jing, 2019, IEEE INT C NETW SENS