A new data compression technique for event based program traces

作者: Andreas Knüpfer

DOI: 10.1007/3-540-44863-2_94

关键词:

摘要: The paper presents an innovative solution to the problem of very huge data sets that are regularly produced by performance tracing techniques - especially on HPC programs. It designs adapted compression scheme takes advantage regularities frequently found in program traces. Algorithms reveal repetition patterns a programs call structure and run time behavior discussed detail, solutions some problems arising practical application addressed as well. Two examples demonstrate capabilities approach document its behavior. Finally, thoughts given regarding how revealed process may assist automatic analysis

参考文章(15)
Donald E Knuth, James H Morris, Jr, Vaughan R Pratt, Fast Pattern Matching in Strings SIAM Journal on Computing. ,vol. 6, pp. 323- 350 ,(1977) , 10.1137/0206024
Oleg Y. Nickolayev, Philip C. Roth, Daniel A. Reed, Real-Time Statistical Clustering for Event Trace Reduction ieee international conference on high performance computing data and analytics. ,vol. 11, pp. 144- 159 ,(1997) , 10.1177/109434209701100207
G. Davies, S. Bowsher, Algorithms for pattern matching Software - Practice and Experience. ,vol. 16, pp. 575- 601 ,(1986) , 10.1002/SPE.4380160608
M. V. Wilkes, The Art of Computer Programming, Volume 3, Sorting and Searching The Computer Journal. ,vol. 17, pp. 324- 324 ,(1974) , 10.1093/COMJNL/17.4.324
Rainer Klar, Peter Dauphin, Franz Hartleb, Richard Hofmann, Bernd Mohr, Andreas Quick, Markus Siegle, Messung und Modellierung paralleler und verteilter Rechensysteme Vieweg+Teubner Verlag. ,(1995) , 10.1007/978-3-322-99681-7
Donald Ervin Knuth, The Art of Computer Programming ,(1968)
Thomas T. Cormen, Ronald L. Rivest, Charles E. Leiserson, Introduction to Algorithms ,(1990)
Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching Addison Wesley Longman Publishing Co., Inc.. ,(1998)