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 corresponds 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 is a read of a single variable. So the reason to keep the threshold low is gone.
Look into increasing this threshold to catch more eager reclaim candidates.
Currently this threshold corresponds 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-8223162 Improve ergonomics for Sparse PRT entry sizing
-
- Resolved
-
-
JDK-8233919 Incrementally calculate the occupied cards in a heap region remembered set
-
- Resolved
-