|
1. |
Construction and compression of complete call graphs for post-mortem program trace analysis
Knupfer, A.; Nagel, W.E.;
Parallel Processing, 2005. ICPP 2005. International Conference on
14-17 June 2005
Page(s):165
-
172
Abstract:
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 or lossless data compression. The compression scheme is completely transparent with respect to read access decompression is not required. This approach is a new way to cope with todays challenges when analyzing enormous amounts of trace data. The article focuses on CCG construction and compression, querying and evaluation are briefly covered.
|
Cart
