Construction and compression of complete call graphs for post-mortem program trace analysis

@article{Knpfer2005ConstructionAC,
  title={Construction and compression of complete call graphs for post-mortem program trace analysis},
  author={Andreas Kn{\"u}pfer and Wolfgang E. Nagel},
  journal={2005 International Conference on Parallel Processing (ICPP'05)},
  year={2005},
  pages={165-172}
}
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… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Nagel . Compressible Memory Data Structures for Event Based Trace Analysis

  • E. Wolfgang
  • 2005

Malony and Sameer Shende . Performance Technology for Complex Parallel and Distributed Systems

  • D. Allen
  • 2003

A Finite- Element Based Navier-Stokes-Solver for LES

  • W. Wienken, J. Stiller, U. Fladrich
  • In Proceedings of the Parallel CFD 2002…
  • 2002
1 Excerpt

VTF3 - A Fast Vampir Trace File Low-Level Library

  • S. Seidl
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…