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

Overflow list performance can be improved

XMLWordPrintable

    • gc
    • 1.4.2
    • b01
    • generic, x86
    • generic, windows_2003
    • Verified

        The expected complexity for completely draining a long list
        can be reduced from quadratic to linear time when the
        contention is low. The current code causes quadratic
        complexity even when there is no contention for the overflow list.

        Should check other collectors to see if the same problem
        exists in any of the other collectors (in particular ParNew
        which also uses overflow lists in somewhat similar fashion).

              ysr Y. Ramakrishna
              ysr Y. Ramakrishna
              Votes:
              0 Vote for this issue
              Watchers:
              1 Start watching this issue

                Created:
                Updated:
                Resolved:
                Imported:
                Indexed: