PerfXplain: debugging MapReduce job performance

PVLDB(2012)

引用 86|浏览76
暂无评分
摘要
While users today have access to many tools that assist in performing large scale data analysis tasks, understanding the performance characteristics of their parallel computations, such as MapReduce jobs, remains difficult. We present PerfXplain, a system that enables users to ask questions about the relative performances (i.e., runtimes) of pairs of MapReduce jobs. PerfXplain provides a new query language for articulating performance queries and an algorithm for generating explanations from a log of past MapReduce job executions. We formally define the notion of an explanation together with three metrics, relevance, precision, and generality, that measure explanation quality. We present the explanation-generation algorithm based on techniques related to decision-tree building. We evaluate the approach on a log of past executions on Amazon EC2, and show that our approach can generate quality explanations, outperforming two naïve explanation-generation methods.
更多
查看译文
关键词
relative performance,explanation-generation algorithm,explanation-generation method,past mapreduce job execution,debugging mapreduce job performance,quality explanation,measure explanation quality,past execution,articulating performance query,mapreduce job,performance characteristic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要