A pattern fusion model for multi-step

advertisement
A pattern fusion model for
multi-step-ahead CPU load prediction
Systems and Software
Dingyu Yanga, Jian Caoa,∗, Jiwen Fua, Jie Wangb,
Jianmei Guoc
ιΎθˆœη’½
1
Introduction
• Resource availability often changes from time to time
and schedulers needs a global view of all resources in
a distributed system.
• Sometimes high CPU load means performance
anomalies that may result in system collapse.
2
WNN and PSF
• Weighted Nearest Neighbors (WNN) algorithm
• Pattern Sequence-based Forecasting (PSF) algorithm
• Euclidean distance
– not enough to match the similar patterns.
3
WNN and PSF (cont.)
• One-step-ahead prediction strategy
– if the one-step-ahead value is not accurate, the predictions
for the following points in time will become more and
more inaccurate.
4
A pattern fusion model for multi-stepahead CPU load prediction
5
Pattern extraction
6
Pattern extraction (cont.)
7
Pattern extraction (cont.)
CPU load
9
8
7
6
5
CPU load
4
3
2
1
0
0
1
2
3
4
5
6
7
8
8
Pattern extraction (cont.)
• Pattern filtering
π‘›π‘’π‘šπ‘π‘’π‘Ÿ(π‘“π‘–π‘™π‘‘π‘’π‘Ÿ(𝑄𝑖 ))
≤1−𝛼
π‘›π‘’π‘šπ‘π‘’π‘Ÿ(𝑄𝑖 )
π‘“π‘–π‘™π‘‘π‘’π‘Ÿ 𝑄𝑖 : π‘Ž π‘“π‘’π‘›π‘π‘‘π‘–π‘œπ‘› π‘‘β„Žπ‘Ž π‘Ÿπ‘’π‘‘π‘’π‘Ÿπ‘›π‘  π‘Ž π‘π‘Žπ‘‘π‘‘π‘’π‘Ÿπ‘› 𝑠𝑒𝑏𝑠𝑒𝑑 π‘€π‘–π‘‘β„Ž β„Žπ‘–π‘”β„Žπ‘’π‘Ÿ π‘œπ‘π‘π‘’π‘Ÿπ‘Ÿπ‘’π‘›π‘π‘’
π‘“π‘Ÿπ‘’π‘žπ‘’π‘’π‘›π‘π‘¦
π‘›π‘’π‘šπ‘π‘’π‘Ÿ 𝑄𝑖 : π‘π‘Žπ‘‘π‘‘π‘’π‘Ÿπ‘› π‘›π‘’π‘šπ‘π‘’π‘Ÿ
π‘›π‘’π‘šπ‘π‘’π‘Ÿ π‘“π‘–π‘™π‘‘π‘’π‘Ÿ 𝑄𝑖 : π‘›π‘’π‘šπ‘π‘’π‘Ÿ π‘œπ‘“ π‘Ÿπ‘’π‘šπ‘Žπ‘–π‘›π‘–π‘›π‘” π‘π‘Žπ‘‘π‘‘π‘’π‘Ÿπ‘›π‘ 
• Pattern merging
↑↑↑↑↑↑↑↑
↑↑↑∗↑↑↑↑
↑↑↑↓↑↑↑↑
9
Pattern matching
10
Pattern matching (cont.)
• Pattern similarity matching
– Euclidean distance matching
𝑑𝑖𝑠𝑑 𝑖, 𝑗 = 𝑋𝑖 − π‘šπ‘—
π‘‡β„Žπ‘’ π‘‘π‘œπ‘ π‘˜ π‘›π‘’π‘Žπ‘Ÿπ‘’π‘ π‘‘ π‘π‘Žπ‘‘π‘‘π‘’π‘Ÿπ‘›π‘  π‘π‘Žπ‘› 𝑏𝑒 π‘β„Žπ‘œπ‘ π‘’π‘›
– Fluctuation pattern set matching
𝑋𝑖′ − π‘šπ‘—′
πœ† ≥1−
π‘™π‘’π‘›π‘”π‘‘β„Ž(𝑋𝑖′ )
11
Pattern weighting strategy
• Average rule strategy
12
Pattern weighting strategy (cont.)
• Uniform decline strategy
πœ”π‘– = 1 𝑙
𝑖
πœ”
πœ”π‘–′ = 𝑖
𝑑
𝑖=1 πœ”π‘–
13
Pattern weighting strategy (cont.)
14
Pattern weighting strategy (cont.)
15
Prediction results function
• Adaboost algorithm
𝑑
𝑀
𝑖
1. 𝑠𝑒𝑑 πœ‘π‘–π‘‘ = 𝑛
𝑑
𝑖=1 𝑀𝑖
2. π‘’π‘Ÿπ‘Ÿπ‘‘ =
𝑛
𝑑
𝑖=1 πœ‘π‘–
∗ 𝐼 𝑑𝑖 ≠ β„Žπ‘š π‘₯𝑖
𝑛
𝑑
𝑖=1 πœ‘π‘–
𝐼=
1 𝑑𝑖 ≠ β„Žπ‘š π‘₯𝑖
0 𝑑𝑖 = β„Žπ‘š π‘₯𝑖
1 1 − π‘’π‘Ÿπ‘Ÿπ‘‘
3. 𝛼𝑑 = ln
2
π‘’π‘Ÿπ‘Ÿπ‘‘
4. πœ‘π‘–π‘‘ = πœ‘π‘–π‘‘ ∗ 𝑒π‘₯𝑝 𝛼𝑑 ∗ 𝐼 𝑑𝑖 ≠ β„Žπ‘š π‘₯𝑖
16
Prediction results function (cont.)
• Prediction values from different values of various
length patterns:
17
Experiment
• Experiment settings
– Mean absolute error (MAE)=
1
𝑁
𝑁
𝑖=1
– Mean relative error (MRE)= 100 ∗
1
𝑁
π‘₯𝑖 − π‘₯
𝑁 π‘₯𝑖 −π‘₯
𝑖=1 π‘₯
𝑖
18
Experiment (cont.)
19
Experiment (cont.)
• Pattern similarity measurement
• The influences of filter parameter
π‘›π‘’π‘šπ‘π‘’π‘Ÿ(π‘“π‘–π‘™π‘‘π‘’π‘Ÿ(𝑄𝑖 ))
≤1−𝛼
π‘›π‘’π‘šπ‘π‘’π‘Ÿ(𝑄𝑖 )
20
Experiment (cont.)
• Different pattern weighting strategies
• Multi-step-ahead predictions
21
Experiment (cont.)
• Comparison with iterative one-step-ahead prediction
22
Experiment (cont.)
• Comparisons with other prediction approaches
• Run time
23
Conclusion
• The contribution of this paper is a fusion model for
multi-step-ahead CPU load prediction.
• We plan to consider longer steps and improve the
prediction accuracy in future.
• In addition, multivariate prediction, such as memory
usage and disk usage predictions are also interesting
topics.
24
Download