This paper addresses performance and scalability issues of state-of-the-art trace analysis. The Complete Call Graph (CCG) data structure is proposed as an alternative to the common linear storage schemes. By transparent in-memory compression CCGs are capable of exploiting redundancy as frequently found in traces and thus reduce the memory requirements notably. Evaluation algorithms can be designed to take advantage of CCGs, too, such that the computational effort is reduced in the same order of magnitude as the memory requirements. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Knüpfer, A., & Nagel, W. E. (2005). New algorithms for performance trace analysis based on compressed complete call graphs. In Lecture Notes in Computer Science (Vol. 3515, pp. 116–123). Springer Verlag. https://doi.org/10.1007/11428848_15
Mendeley helps you to discover research relevant for your work.