Mirror/powersort
1
0
Fork 0
mirror of https://gitlab.uni-marburg.de/langbeid/powersort.git synced 2025-01-21 19:50:35 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

benchmark: more warmup iterations

Browse Source
This commit is contained in:
Daniel Langbein 2025-01-21 16:33:42 +00:00
parent 592eda73a6
commit 60ca1275b5
Signed by: langfingaz
GPG Key ID: 6C47C753F0823002
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
app/src/jmh/java/de/uni_marburg/powersort/benchmark/JmhBase.java
View File

@ -41,7 +41,11 @@ import java.util.concurrent.TimeUnit;
// - "More warmup/measurement iterations are generally required." // - "More warmup/measurement iterations are generally required."
// - "Timers overhead might be significant if benchmarks are small;" // - "Timers overhead might be significant if benchmarks are small;"
@BenchmarkMode(Mode.SingleShotTime) @BenchmarkMode(Mode.SingleShotTime)
@Warmup(iterations = 12) // During warmup iterations for ASCENDING_RUNS (with TIM_SORT and FASTER_FINN_SORT):
// - Until the 17th spike of up to +750% (Maybe JVM optimizations happening?)
// - After 40th constant slowdown of around +10% (Maybe CPU frequency adjustments?)
// Thus, we need at least ~50 warmup iterations!
@Warmup(iterations = 50)
@Measurement(iterations = 6) @Measurement(iterations = 6)
/* /*