Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2487575.2488211acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Efficiently rewriting large multimedia application execution traces with few event sequences

Published: 11 August 2013 Publication History

Abstract

The analysis of multimedia application traces can reveal important information to enhance program execution comprehension. However typical size of traces can be in gigabytes, which hinders their effective exploitation by application developers. In this paper, we study the problem of finding a set of sequences of events that allows a reduced-size rewriting of the original trace. These sequences of events, that we call blocks, can simplify the exploration of large execution traces by allowing application developers to see an abstraction instead of low-level events.
The problem of computing such set of blocks is NP-hard and naive approaches lead to prohibitive running times that prevent analysing real world traces. We propose a novel algorithm that directly mines the set of blocks. Our experiments show that our algorithm can analyse real traces of up to two hours of video. We also show experimentally the quality of the set of blocks proposed, and the interest of the rewriting to understand actual trace data.

References

[1]
Gstreamer website. www.gstreamer.net. Accessed:20/02/2013.
[2]
B. Cornelissen, D. Holten, A. Zaidman, L. Moonen, J. J. van Wijk, and A. van Deursen. Understanding Execution Traces Using Massive Sequence and Circular Bundle Views. 15th IEEE International Conference on Program Comprehension (ICPC '07), pages 49--58, 2007.
[3]
J. Egeblad. Heuristics for Multidimensional Packing Problems. PhD thesis, University of Copenhagen, Department of Computer Science, 2008.
[4]
A. Hamou-Lhadj and T. C. Lethbridge. A survey of trace exploration tools and techniques. In Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research, CASCON '04, pages 42--55. IBM Press, 2004.
[5]
K. J. Hoffman, P. Eugster, and S. Jagannathan. Semantics-aware trace analysis. In ACM SIGPLAN Notices, volume 44, page 453, May 2009.
[6]
C. K. Kengne, L. C. Fopa, N. Ibrahim, A. Termier, M.-C. Rousset, and T. Washio. Enhancing the analysis of large multimedia applications execution traces with frameminer. In ICDM Workshops, pages 595--602, 2012.
[7]
H. Kim, S. Im, T. Abdelzaher, J. Han, D. Sheridan, and S. Vasudevan. Signature Pattern Covering via Local Greedy Algorithm and Pattern Shrink. 2011 IEEE 11th International Conference on Data Mining, pages 330--339, Dec. 2011.
[8]
Y.-C. Li, J.-S. Yeh, and C.-C. Chang. Isolated items discarding strategy for discovering high utility itemsets. 2007.
[9]
J. Liu, K. Wang, and B. Fung. Direct discovery of high utility itemsets without candidate generation. In Data Mining (ICDM), 2012 IEEE 12th International Conference on, pages 984--989. IEEE, 2012.
[10]
H. Pirzadeh and A. Hamou-Lhadj. A Novel Approach Based on Gestalt Psychology for Abstracting the Content of Large Execution Traces for Program Comprehension. In 2011 16th IEEE International Conference on Engineering of Complex Computer Systems, pages 221--230. IEEE, 2011.
[11]
H. Pirzadeh, S. Shanian, A. Hamou-Lhadj, and A. Mehrabian. The Concept of Stratified Sampling of Execution Traces. In 2011 IEEE 19th International Conference on Program Comprehension, pages 225--226. IEEE, 2011.
[12]
K. Smets and J. Vreeken. Slim: Directly mining descriptive patterns. In Proc of the SDM, volume 12, 2012.
[13]
B. D. O. Stein. Pajé trace file format. 2003.
[14]
N. Tatti and J. Vreeken. The long and the short of it: Summarising event sequences with serial episodes. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 462--470. ACM, 2012.
[15]
V. S. Tseng, C.-W. Wu, B.-E. Shie, and P. S. Yu. Up-growth: an efficient algorithm for high utility itemset mining. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pages 253--262, New York, NY, USA, 2010. ACM.
[16]
Z. Weg and R. Henschel. Introducing OTF / Vampir / VampirTrace. Memory.
[17]
C. W. Wu, B.-E. Shie, V. S. Tseng, and P. S. Yu. Mining top-k high utility itemsets. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, pages 78--86, New York, NY, USA, 2012. ACM.
[18]
J. Yin, Z. Zheng, and L. Cao. Uspan: an efficient algorithm for mining high utility sequential patterns. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, pages 660--668, New York, NY, USA, 2012. ACM.
[19]
J. Zou, J. Xiao, R. Hou, and Y. Wang. Frequent Instruction Sequential Pattern Mining in Hardware Sample Data. 2010 IEEE International Conference on Data Mining, pages 1205--1210, Dec. 2010.

Cited By

View all
  • (2021)Extracting method of packet dependence from NoC simulation traces using association rule miningAnalog Integrated Circuits and Signal Processing10.1007/s10470-020-01645-6106:1(235-247)Online publication date: 1-Jan-2021
  • (2016)A Survey of event extraction methods from text for decision support systemsDecision Support Systems10.1016/j.dss.2016.02.00685:C(12-22)Online publication date: 1-May-2016

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '13: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
August 2013
1534 pages
ISBN:9781450321747
DOI:10.1145/2487575
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 August 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. combinatorial optimization
  2. execution traces
  3. multimedia apllications
  4. pattern mining

Qualifiers

  • Research-article

Conference

KDD' 13
Sponsor:

Acceptance Rates

KDD '13 Paper Acceptance Rate 125 of 726 submissions, 17%;
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Extracting method of packet dependence from NoC simulation traces using association rule miningAnalog Integrated Circuits and Signal Processing10.1007/s10470-020-01645-6106:1(235-247)Online publication date: 1-Jan-2021
  • (2016)A Survey of event extraction methods from text for decision support systemsDecision Support Systems10.1016/j.dss.2016.02.00685:C(12-22)Online publication date: 1-May-2016

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media