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

Overflow list performance can be improved

    XMLWordPrintable

    Details

    • Subcomponent:
      gc
    • Introduced In Build:
      1.4.2
    • Introduced In Version:
    • Resolved In Build:
      b01
    • CPU:
      generic, x86
    • OS:
      generic, windows_2003
    • Verification:
      Verified

      Backports

        Description

        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).

          Attachments

            Issue Links

              Activity

                People

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

                  Dates

                  Created:
                  Updated:
                  Resolved:
                  Imported:
                  Indexed: