arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1704.02855cs.DCcs.DBcs.PF
收藏

一种基于决策树的分布式应用自适应性能分析方法

A Decision Tree Based Approach Towards Adaptive Profiling of Distributed Applications

Ioannis Giannakopoulos, Dimitrios Tsoumakos, Nectarios Koziris

摘要:

分布式范例的采用允许应用程序增加它们的可伸缩性、鲁棒性和容错,但它也使它们的结构复杂化,导致应用程序的配置空间呈指数增长,并增加了预测它们的性能的难度。在这项工作中,我们描述了一种新的,自动分析方法,使应用程序结构上没有任何假设。我们的方法利用斜决策树,以递归地划分应用程序的配置空间在不相交的区域,选择一组代表性的样本,从每个子区域根据定义的政策和返回的模型为整个空间的线性模型组成的每个子区域。在现实生活中的应用程序和综合性能函数的广泛评估表明,我们的计划优于其他国家的最先进的分析方法。它特别擅长反映性能函数的异常和不连续性,允许用户根据建模精度和空间覆盖范围影响采样策略。

英文摘要:

The adoption of the distributed paradigm has allowed applications to increase their scalability, robustness and fault tolerance, but it has also complicated their structure, 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 return a model for the entire space as a composition of linear models over each subregion. An extensive 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 and the space coverage.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑