-
Enhancement
-
Resolution: Unresolved
-
P4
-
14, 15
The selection of candidates for eager reclaim of humongous objects mostly depends on the number of remembered set entries for that humongous object.
Currently this threshold is ergonomically set to the sparse prt entry count as gathering the number of remembered set entries for the higher level PRTs is considered too costly. This sparse prt entry count is very low, although it has increased inJDK-8223162.
However, withJDK-8233919 this operation to get number of entries in the card set is a read of a single variable. JDK-8267836 also separates this threshold from the number of sparse prt entries. So the reason to keep the threshold low is gone.
Look into increasing this threshold to catch more eager reclaim candidates.
Currently this threshold is ergonomically set to the sparse prt entry count as gathering the number of remembered set entries for the higher level PRTs is considered too costly. This sparse prt entry count is very low, although it has increased in
However, with
Look into increasing this threshold to catch more eager reclaim candidates.
- relates to
-
JDK-8267933 Opportunistically recalculate remembered sets for almost-eager reclaim candidates
-
- Open
-
-
JDK-8223162 Improve ergonomics for Sparse PRT entry sizing
-
- Resolved
-
-
JDK-8267836 Separate eager reclaim remembered set threshold from G1RSetSparseRegionEntries
-
- Resolved
-
-
JDK-8233919 Incrementally calculate the occupied cards in a heap region remembered set
-
- Resolved
-