New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
8255984: Shenandoah: "adaptive" heuristic is prone to missing load spikes #1099
8255984: Shenandoah: "adaptive" heuristic is prone to missing load spikes #1099
Commits on Nov 5, 2020
-
Add a "reactive" heuristic for triggering concurrent GC cycles
The reactive heuristic maintains a margin of error and a spike detection mechanism to trigger cycles somewhat more aggressively than the 'adaptive' heuristic. This heuristic 'reacts' to the outcome of GC cycles by adjusting the sensitivity of the triggers.
Commits on Nov 10, 2020
-
- Remove unnecessary log level checks - More idiomatic style
-
Commits on Nov 12, 2020
-
Remove const qualifier from should_start_gc
This lets the heuristics update state without const_casts.
Commits on Nov 13, 2020
-
-
-
-
-
Use os::elapsedTime to avoid type issues and to be consistent with ot…
…her heuristics code
Commits on Nov 16, 2020
Commits on Nov 17, 2020
Commits on Nov 19, 2020
Commits on Nov 20, 2020
-
Sample allocation rate even if cumulative bytes allocated hasn't changed
Without this, the average allocation rate will be much higher than it should be.
-
Do not re-sample allocation rate with higher frequency
This causes too many false positives and triggers unnecessary cycles.