Building Approximate Calling Context from Partial Call Traces

We present an approach for building calling context information useful for program understanding, performance analysis and optimizations. Our approach exploits a lightweight profiling mechanism providing partial call traces. The goal is to reconstruct calling context information as accurately as pos...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Code Generation and Optimization, Proceedings s. 221 - 230
Hlavní autoři: Serrano, Mauricio, Zhuang, Xiaotong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Washington, DC, USA IEEE Computer Society 22.03.2009
IEEE
Edice:ACM Conferences
Témata:
Call Context Analysis
Calling Context Tree
Hardware
Instruments
Java
Legged locomotion
Merging
Monitoring
Navigation
Operating systems
Performance analysis
Program Understanding
Sampling methods
Software and its engineering > Software notations and tools > Compilers
Software and its engineering > Software notations and tools > General programming languages > Language features > Procedures, functions and subroutines
Theory of computation > Semantics and reasoning > Program reasoning > Program analysis
Theory of computation > Semantics and reasoning > Program semantics
Calling Context Tree
Program Understanding
Call Context Analysis
ISBN:9780769535760, 0769535763
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present an approach for building calling context information useful for program understanding, performance analysis and optimizations. Our approach exploits a lightweight profiling mechanism providing partial call traces. The goal is to reconstruct calling context information as accurately as possible, and to help the user navigate through it.We propose three steps to merge partial call traces into a smaller number of partial calling context trees. We intend to minimize errors such that the final partial contexts represent actual components of the real calling context tree with a very high probability. The first step concatenates call traces based on their common sequences. The second step converts call traces into partial calling context trees, and the last step merges partial context trees through maximal matching. To gauge how well the merged trees represent the full calling context tree, several criteria are presented. Our results indicate that call traces are successfully merged into a small number of large calling context trees. The merged trees are highly accurate.We have also developed a semi-automatic tool to navigate across partial calling context trees for program understanding and performance analysis purposes. Our results for several Java benchmarks show that our merging strategies exhibit a maximum 1% inaccuracy when compared to the exact solution.
ISBN:9780769535760
0769535763
DOI:10.1109/CGO.2009.12