United StatesChange Country, Oracle Worldwide Web Sites Communities I am a... I want to...
Bug ID: JDK-6786503 Overflow list performance can be improved
JDK-6786503 : Overflow list performance can be improved

Details
Type:
Enhancement
Submit Date:
2008-12-17
Status:
Closed
Updated Date:
2011-03-07
Project Name:
JDK
Resolved Date:
2011-03-07
Component:
hotspot
OS:
windows_2003,generic
Sub-Component:
gc
CPU:
x86,generic
Priority:
P3
Resolution:
Fixed
Affected Versions:
5.0u15,5.0u16
Fixed Versions:
hs15 (b01)

Related Reports
Backport:
Backport:
Backport:
Backport:
Backport:
Backport:
Backport:
Backport:
Backport:
Backport:
Relates:
Relates:

Sub Tasks

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

                                    

Comments
EVALUATION

The same problem exists in ParNew and CMS. A patch for the fix
has been generated and performance tests are currently in progress
to assess the impact in low contention and high contention scenarios.
(Some policy tweaks may be necessary once initial performance
numbers are in.)

A test binary will be made available for performance testing by customer.
                                     
2009-01-05
SUGGESTED FIX

Preliminary shape of the changes (by no means final):-

http://analemma.sfbay.sun.com/net/neeraja/export/ysr/overflow/webrev
                                     
2009-01-12
EVALUATION

http://hg.openjdk.java.net/jdk7/hotspot-gc/hotspot/rev/5cfd8d19e546
                                     
2009-01-27



Hardware and Software, Engineered to Work Together