Abstracting Runtime Heaps for Program Understanding

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Modern programming environments provide extensive support for inspecting, analyzing, and testing programs based on the algorithmic structure of a program. Unfortunately, support for inspecting and understanding runtime data structures during execution is typically much more limited. This paper provides a general purpose technique for abstracting and summarizing entire runtime heaps. We describe the abstract heap model and the associated algorithms for transforming a concrete heap dump into the corresponding abstract model as well as algorithms for merging, comparing, and computing changes between abstract models. The abstract model is designed to emphasize high-level concepts about heap-based data structures, such as shape and size, as well as relationships between heap structures, such as sharing and connectivity. We demonstrate the utility and computational tractability of the abstract heap model by building a memory profiler. We then use this tool to check for, pinpoint, and correct sources of memory bloat from a suite of programs from DaCapo.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Abstracting Runtime Heaps for Program Understanding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Abstracting Runtime Heaps for Program Understanding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abstracting Runtime Heaps for Program Understanding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-661425

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.