A Decision Tree Based Approach Towards Adaptive Profiling of Cloud Applications
Preprint
Abstract
Cloud computing has allowed applications to allocate and elastically utilize massive amounts of resources of different types, leading to an exponential growth of the applications' configuration space and increased difficulty in predicting their performance. In this work, we describe a novel, automated profiling methodology that makes no assumptions on application structure. Our approach utilizes oblique Decision Trees in order to recursively partition an application's configuration space in disjoint regions, choose a set of representative samples from each subregion according to a defined policy and returns a model for the entire configuration space as a composition of linear models over each subregion. An extensive experimental evaluation over real-life applications and synthetic performance functions showcases that our scheme outperforms other state-of-the-art profiling methodologies. It particularly excels at reflecting abnormalities and discontinuities of the performance function, allowing the user to influence the sampling policy based on the modeling accuracy, the space coverage and the deployment cost.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Cloud Crawler: a declarative performance evaluation environment for infrastructure‐as‐a‐service cloudsConcurrency and Computation: Practice and Experience, 2016
- Cloud computing — The business perspectiveDecision Support Systems, 2011
- Ensemble-based classifiersArtificial Intelligence Review, 2009
- Constructing optimal binary decision trees is NP-completeInformation Processing Letters, 1976
- Principles of Neurodynamics: Perceptrons and the Theory of Brain MechanismsThe American Journal of Psychology, 1963