diff options
| author | Roman Musin <995612+roman-r-m@users.noreply.github.com> | 2024-01-20 19:30:25 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-01-20 20:30:25 +0100 |
| commit | 9100ed6316207b6963d31d3ae604a317932d2d13 (patch) | |
| tree | a5c9c617b113e8a4b6e6a10ee02056b40759d2b9 /calculate_average_roman-r-m.sh | |
| parent | 062f2bbecf586d85ff44dec42cc63f94e49bc6b8 (diff) | |
Epsilon GC + a number of other small tweaks (#513)
* Version 3
* Use SWAR algorithm from netty for finding a symbol in a string
* Faster equals - store the remainder in a long field (- 0.5s)
* optimise parsing numbers - prep
* Keep tweaking parsing logic
* Rewrote number parsing
may be a tiby bit faster it at all
* Epsilon GC
Diffstat (limited to 'calculate_average_roman-r-m.sh')
| -rwxr-xr-x | calculate_average_roman-r-m.sh | 6 |
1 files changed, 6 insertions, 0 deletions
diff --git a/calculate_average_roman-r-m.sh b/calculate_average_roman-r-m.sh index 47626a1..fe468dc 100755 --- a/calculate_average_roman-r-m.sh +++ b/calculate_average_roman-r-m.sh @@ -16,4 +16,10 @@ # JAVA_OPTS="--enable-preview -XX:+UseTransparentHugePages" + +# epsilon GC needs enough memory or it makes things worse +# see https://stackoverflow.com/questions/58087596/why-are-repeated-memory-allocations-observed-to-be-slower-using-epsilon-vs-g1 +# 2GB seems to be the sweet spot +JAVA_OPTS="$JAVA_OPTS -XX:+UnlockExperimentalVMOptions -XX:-EnableJVMCI -XX:+UseEpsilonGC -Xmx2G -Xms2G -XX:+AlwaysPreTouch" + java $JAVA_OPTS --class-path target/average-1.0.0-SNAPSHOT.jar dev.morling.onebrc.CalculateAverage_roman_r_m |