|
| Re: comparing heap dumps? [message #629199 is a reply to message #629020] |
Mon, 27 September 2010 13:25  |
 Krum Tsvetkov
Messages: 164
Registered: July 2009 |
Senior Member |
|
|
Comparing is a difficult topic when it comes to heap dumps. In short, the problem is that heap dumps are just snapshots in which the objects do not have a stable identifier.
May be the following blog can help you understand better the limitations, but will not help you solve your problem:
http://dev.eclipse.org/blogs/memoryanalyzer/2010/01/25/heap- dump-analysis-with-memory-analyzer-part-1-heap-dumps/
To be more precise - I am talking about heap dumps which one can get from the VM without using a profiler. Certain profilers do tag the objects, capture allocation stacks, count which objects are GCed, etc...
Memory Analyzer just analyzes heap dumps and such questions about the objects' dynamics are difficult to answer. It offers the possibility to compare the class histograms of two heap dumps, or (since 1.0) also the possibility to compare the retained sets of two or more objectct sets (on class level). For the latter see the New & Noteworthy document for MAT 1.0 - http://www.eclipse.org/mat/1.0/noteworthy.html.
But I think that even without the possibility to recognize new objects and without using some special comparison features, one can still get some hints by analyzing the heap dumps.
What may be help, for example, is to look with Memory Analyzer at the dominator tree and inspect the biggest object(s) there. Find how much it (they) have grown, expand the tree to find an accumulation point and see what it references, look at the paths from the GC roots to the accumulation point, etc... Do this for more than one heap dumps (manually) and see if you get some better idea about the problem.
One blog that may be helpful is:
http://dev.eclipse.org/blogs/memoryanalyzer/2008/05/27/autom ated-heap-dump-analysis-finding-memory-leaks-with-one-click/
Let me know if this helps.
Krum
|
|
|
Powered by
FUDForum. Page generated in 0.01983 seconds
] 
Search
Help
Register
Login
Home
