New Full GC for Parallel GC

XMLWordPrintable

    • gc

      I'd like to explore a new algorithm for ParallelGC's full GC. The current implementation is too rigid and can not accomodate Lilliput2's Identity Hash-Code, which requires that object can be expanded by 1 word when the object moves.

            Assignee:
            Unassigned
            Reporter:
            Roman Kennke
            Votes:
            0 Vote for this issue
            Watchers:
            2 Start watching this issue

              Created:
              Updated: