内容简介：Shallow heap is theRetained set of X is the set of objects which would be removed by GC when X is garbage collected.Retained heap of X is the
Shallow heap is the memory consumed by one object . An object needs 32 or 64 bits (depending on the OS architecture) per reference, 4 bytes per Integer, 8 bytes per Long, etc. Depending on the heap dump format the size may be adjusted (e.g. aligned to 8, etc…) to model better the real consumption of the VM.
Retained Set
Retained set of X is the set of objects which would be removed by GC when X is garbage collected.
Retained Heap
Retained heap of X is the sum of shallow sizes of all objects in the retained set of X , i.e. memory kept alive by X.
Generally speaking, shallow heap of an object is its size in the heap and retained size of the same object is the amount of heap memory that will be freed when the object is garbage collected .
The Minimum Retained Size gives a good (under)estimation of the retained size which is calculated ways faster than the exact retained size of a set of objects. It only depends on the number of objects in the inspected set , not the number of objects in the heap dump.
Dominator Tree
Memory Analyzer provides a dominator tree of the object graph. The transformation of the object reference graph into a dominator tree allows you to easily identify the biggest chunks of retained memory and the keep-alive dependencies among objects .
Dominate
An object x dominates an object y if every path in the object graph from the start (or the root) node to y must go through x.
Immediate Dominator
The immediate dominator x of some object y is the dominator closest to the object y.
Properties
- The objects belonging to the sub-tree of x (i.e. the objects dominated by x) represent the retained set of x.
- If x is the immediate dominator of y , then the immediate dominator of x also dominates y , and so on.
- The edges in the dominator tree do not directly correspond to object references from the object graph.
A dominator tree is built out of the object graph. In the dominator tree each object is the immediate dominator of its children , so dependencies between the objects are easily identified.
Overview
Dominator Tree
No Grouping(Objects)
Group By Class
Group By Class Loader
纬度：组件
Group By Package
纬度：自身编写的代码
Path To GC Roots
Histogram
MAT默认按 Shallow Heap 倒排，手动选择按 Retained Heap 倒排，排第一的是 Ehcache 的 OnHeapStore 类
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持 码农网
猜你喜欢:
本站部分资源来源于网络，本站转载出于传递更多信息之目的，版权归原作者或者来源机构所有，如转载稿涉及版权问题，请联系我们。
热搜：搜索排名营销大揭秘
【美】肖恩·布拉德利 / 中国人民大学出版社有限公司 / 2018-7-30 / CNY 55.00
首部大数据在我国政府管理场景中的应用实践案例读本，全面展示我国电子政务与数字化建设的成果，深度理解实施国家大数据战略的重要意义。 本书作者作为国内最早从事大数据应用研究的实践者之一，亲历了中国大数据的发展历程、主要事件、应用案例以及行业变化。 在本书中，作者将其所亲历的大数据发展历程进行了阐述，从大数据的基本概念、特点到实践解读，通俗易懂，给我们的实际工作提供了重要参考。作者将帮助读者......一起来看看 《热搜：搜索排名营销大揭秘》 这本书的介绍吧!
