Construction and compression of complete call graphs for post-mortem program trace analysis
作者： A. Knupfer , W.E. Nagel
DOI: 10.1109/ICPP.2005.28
关键词:
摘要: Compressed complete call graphs (cCCGs) are a newly developed memory data structure for event based program traces. The most important advantage over linear lists or arrays traditionally used is the ability to apply lossy lossless compression. compression scheme completely transparent with respect read access decompression not required. This approach new way cope todays challenges when analyzing enormous amounts of trace data. article focuses on CCG construction and compression, querying evaluation briefly covered.
sci-hub.se 参考文章(14)
Dieter Kranzlmüller, Michael Scarpa, Jens Volkert, DeWiz – A Modular Tool Architecture for Parallel Program Analysis european conference on parallel processing. pp. 74- 80 ,(2003) , 10.1007/978-3-540-45209-6_13
Andreas Knüpfer, A new data compression technique for event based program traces international conference on computational science. pp. 956- 965 ,(2003) , 10.1007/3-540-44863-2_94
W. Wienken, J. Stiller, U. Fladrich, A Finite-Element Based Navier-Stokes Solver for LES Parallel Computational Fluid Dynamics 2002#R##N#New Frontiers and Multi-disciplinary Applications. pp. 361- 368 ,(2003) , 10.1016/B978-044450680-1/50046-2
Andreas Knüpfer, Wolfgang E. Nagel, New Algorithms for Performance Trace Analysis Based on Compressed Complete Call Graphs Lecture Notes in Computer Science. pp. 116- 123 ,(2005) , 10.1007/11428848_15
Holger Brunst, Manuela Winkler, Wolfgang E. Nagel, Hans-Christian Hoppe, Performance Optimization for Large Scale Computing: The Scalable VAMPIR Approach international conference on computational science. pp. 751- 760 ,(2001) , 10.1007/3-540-45718-6_80
Felix Wolf, Bernd Mohr, EARL - A Programmable and Extensible Toolkit for Analyzing Event Traces of Message Passing Programs ieee international conference on high performance computing data and analytics. pp. 503- 512 ,(1999) , 10.1007/BFB0100611
A. Knupfer, H. Brunst, W.E. Nagel, High performance event trace visualization parallel, distributed and network-based processing. pp. 258- 263 ,(2005) , 10.1109/EMPDP.2005.24
Andreas Knüpfer, Wolfgang E. Nagel, Compressible memory data structures for event-based trace analysis Future Generation Computer Systems. ,vol. 22, pp. 359- 368 ,(2006) , 10.1016/J.FUTURE.2004.11.021
Scott F. Kaplan, Yannis Smaragdakis, Paul R. Wilson, Trace reduction for virtual memory simulations measurement and modeling of computer systems. ,vol. 27, pp. 47- 58 ,(1999) , 10.1145/301453.301479
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