More Conservative Incremental GC Scheduling #4161
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
More Conservative Incremental GC Scheduling
The existing incremental GC scheduling is reclaiming memory effectively up to 4GB according to the tests, the GC benchmark, and also other analyzed user programs so far.
However, it could also make sense, to schedule the GC a little bit more conservatively to reduce the allocated memory size, the reclamation latency, and the memory pressure.
Scheduling Refinement
The GC is additionally scheduled on every absolute heap growth of 500 MB or more.
GC benchmark results:
(*) The scalability improvement is mostly due to the
scalable-buffer
benchmark case that scales much higher with this more conservative scheduling. For other cases, the scalability is slightly lower. This heavily depends on when GC is scheduled when the memory is nearly full and the mark bitmaps may no longer be allocated.