Details
-
Enhancement
-
Resolution: Fixed
-
P3
-
9
-
b25
-
generic
-
generic
Description
Basically we currently process cards one by one even though they always
come in groups of at the very least G1UpdateBufferSize. The cards may or
may not follow a particularly cache friendly order, depending on how lucky
we are, and need to do things like seek the start of the card quite often,
as well as cutting arrays at the card intervals, even though many times
the batches of cards could be linearly scanned and follow a contiguous
order.
It would be great if the batches could be scanned as a batch instead of one by one in a more efficient manner by sorting cards by address, collapsing adjacent cards and prefetching the next cards to be processed.
come in groups of at the very least G1UpdateBufferSize. The cards may or
may not follow a particularly cache friendly order, depending on how lucky
we are, and need to do things like seek the start of the card quite often,
as well as cutting arrays at the card intervals, even though many times
the batches of cards could be linearly scanned and follow a contiguous
order.
It would be great if the batches could be scanned as a batch instead of one by one in a more efficient manner by sorting cards by address, collapsing adjacent cards and prefetching the next cards to be processed.
Attachments
Issue Links
- blocks
-
-
- Open
-
- relates to
-
-
- Open
-
-
JDK-8309627 Incorrect sorting of DirtyCardQueue buffers
-
- Resolved
-
-
-
- Open
-