JDK-6826318 : G1: remove traversal-based refinement code
- Type: Enhancement
- Component: hotspot
- Sub-Component: gc
- Affected Version: hs15
- Priority: P5
- Status: Resolved
- Resolution: Fixed
- OS: generic
- CPU: generic
- Submitted: 2009-04-03
- Updated: 2013-09-18
- Resolved: 2009-06-17
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 Availability Release.
To download the current JDK release, click here.
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 Availability Release.
To download the current JDK release, click here.
| JDK 6 | JDK 7 | Other |
|---|---|---|
6u18Fixed  |
7Fixed |
hs16Fixed |
Related Reports
|
Duplicate :
|
Description
Currenty G1 has two algorithms for updating remembered sets. One is queue based, when the mutators put the pointers to the cards they've dirtied in to the queue, which is then processed by a refinement thread. The other is traversal based, that is a refinement thread traverses the card table and refines the dirty cards. The traversal method has apparently more overhead and is not used. It will be beneficial to remove it.
Comments
|