JDK-8027476 : Improve performance of Stringtable unlink
  • Type: Enhancement
  • Status: Resolved
  • Resolution: Fixed
  • Component: hotspot
  • Sub-Component: gc
  • Priority: P4
  • Affected Version: hs25,8
  • Submit Date: 2013-10-29
  • Updated Date: 2014-07-29
  • Resolved Date: 2014-01-20
The Version table provides details related to the release that this issue/RFE will be addressed.

Unresolved : Release in which this issue/RFE will be addressed.
Resolved: Release in which this issue/RFE has been resolved.
Fixed : Release in which this issue/RFE has been fixed. The release containing this fix may be available for download as an Early Access Release or a General Availabitlity Release.

To download the current JDK release, click here.
JDK 7 JDK 8 JDK 9
7u60Fixed 8u20Resolved 9 b03Resolved
Related Reports
Relates :  
Relates :  
Relates :  
Relates :  
Relates :  
Relates :  
Relates :  
Description
At the end of a GC that treated strings as a weak root for traversal, the string table is scanned for unreferenced entries, which are then deleted.

This can be time-consuming if the string table is large; this RFE is about improving the performance.

One way to do this is to parallelize the effort; JDK-8004888 implemented parallel traversal by claiming hash table buckets on a per-thread basis. A similar method could be applied in this case, and provided for all uses in a parallel collector (at least CMS, the parallel gcs, G1 full gc and during the G1 remark pause).