| Issue | Fix Version | Assignee | Priority | Status | Resolution | Resolved In Build |
|---|---|---|---|---|---|---|
| JDK-2179089 | 7 | Igor Veresov | P5 | Closed | Fixed | b61 |
| JDK-2180627 | 6u18 | Igor Veresov | P5 | Resolved | Fixed | b01 |
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.
- backported by
-
JDK-2180627 G1: remove traversal-based refinement code
-
- Resolved
-
-
-
- Closed
-
- duplicates
-
JDK-6817598 G1: remove unnecessary card traversals
-
- Closed
-