Distance-Based Trace Diagnosis for Multimedia Applications: Help Me TED!

Execution traces have become essential resources that many developers analyze to debug their applications. Ideally, a developer wants to quickly detect whether there are anomalies on his application or not. However, in practice, the size of multimedia applications trace can reach gigabytes, which makes their exploitation very complex. Usually, developers use visualization tools before stating a hypothesis. In this paper, we argue that this solution is not satisfactory and propose to automatically provide a diagnosis by comparing execution traces. We use distance-based models and conduct a user case to show how TED, our automatic trace diagnosis tool, provides semantic added-value information to the developer. Performance evaluation over real world data shows that our approach is scalable.

[1]  B. de Oliveira Stein,et al.  Pajé trace file format , 2003 .

[2]  Vipin Kumar,et al.  Introduction to Data Mining , 2022, Data Mining and Machine Learning Applications.

[3]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[4]  Fabian Mörchen,et al.  Time Series Knowledge Mining , 2006 .

[5]  Xavier Raynaud,et al.  Summarizing Embedded Execution Traces through a Compact View , 2010 .

[6]  Panagiotis Papapetrou,et al.  Distance measure for querying sequences of temporal intervals , 2011, PETRA '11.

[7]  Heikki Mannila,et al.  Similarity of event sequences , 1997, Proceedings of TIME '97: 4th International Workshop on Temporal Representation and Reasoning.

[8]  Justin Seyster,et al.  Techniques for Visualizing Software Execution , 2008 .

[9]  R. Krishnakumar.  Kernel korner: kprobes-a kernel debugger , 2005 .

[10]  Simon Dobrisek,et al.  An Edit-Distance Model for the Approximate Matching of Timed Strings , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Tim Wright,et al.  Visualisations of execution traces (VET): an interactive plugin-based visualisation tool , 2006, AUIC.

[12]  Alexandre Termier,et al.  Efficiently rewriting large multimedia application execution traces with few event sequences , 2013, KDD.

[13]  Laurent Amsaleg,et al.  Estimation de similarité entre séquences de descripteurs à l'aide de machines à vecteurs supports , 2007, BDA.

[14]  L. Bergroth,et al.  A survey of longest common subsequence algorithms , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[15]  Vipin Kumar,et al.  Anomaly Detection for Discrete Sequences: A Survey , 2012, IEEE Transactions on Knowledge and Data Engineering.

[16]  Christos Faloutsos,et al.  Stream Monitoring under the Time Warping Distance , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[17]  James Roberts.  TraceVis: An Execution Trace Visualization Tool , 2004 .

[18]  Odd Erik Gundersen.  Toward Measuring the Similarity of Complex Event Sequences in Real-Time , 2012, ICCBR.

[19]  Cesare Furlanello,et al.  mlpy: Machine Learning Python , 2012, ArXiv.

[20]  Eugene W. Myers,et al.  An O(NP) Sequence Comparison Algorithm , 1990, Inf. Process. Lett..