Replace SummaryDiff's array implementation with a hashtable

XMLWordPrintable

    • Type: Enhancement
    • Resolution: Unresolved
    • Priority: P4
    • 27
    • Affects Version/s: None
    • Component/s: hotspot

      The SummaryDiff of today works by materializing its counters for all possible memtags. However, typically only a few MemTags will actually have their values change. This means that SummaryDiff is unnecessarily costly. We can optimize this by implementing an open addressing/closed hashing hashtable.

      This will matter more as the number of MemTags grow.

            Assignee:
            Johan Sjölen
            Reporter:
            Johan Sjölen
            Votes:
            0 Vote for this issue
            Watchers:
            1 Start watching this issue

              Created:
              Updated: