Uploaded image for project: 'JDK'
  1. JDK
  2. JDK-8267933

Opportunistically recalculate remembered sets for almost-eager reclaim candidates

XMLWordPrintable

    • gc

      Selection of eager reclaim candidates is based on the number of remembered set entries.

      This is a fixed threshold, if the number of entries in the card remembered set is larger than that, we never try to eager reclaim that region.

      Marking already rebuilds the remembered sets for those, but marking rounds can be far apart. Maybe it is useful to flush the remembered sets of a few of these near-candidates into the DCQ regularly to see whether something changed?

            Unassigned Unassigned
            tschatzl Thomas Schatzl
            Votes:
            0 Vote for this issue
            Watchers:
            1 Start watching this issue

              Created:
              Updated: