Skip to content
  • Sebastian Graf's avatar
    Stabilise benchmarks wrt. GC · 8632268a
    Sebastian Graf authored
    Summary:
    This is due to #15999, a follow-up on #5793 and #15357 and changes all
    benchmarks, some of them (i.e. `wheel-sieve1`, `awards`) rather drastically.
    
    The general plan is outlined in #15999: Identify GC-sensitive benchmarks by
    looking at how productivity rates change over different nursery sizes and
    iterate `main` of these benchmarks often enough for the non-monotony and
    discontinuities to go away.
    
    I was paying attention that the benchmarked logic is actually run $n times more
    often, rather than just benchmarking IO operations printing the result of CAFs.
    
    When I found benchmarks with insignificant runtime (#15357), I made sure that
    parameters/input files were adjusted so that runtime of the different modes
    fall within the ranges proposed in
    https://ghc.haskell.org/trac/ghc/ticket/15357#comment:4
    
    - fast: 0.1-0.2s
    - norm: 1-2s
    - slow: 5-10s
    
    This is what I did:
    
    - Stabilise bernoulli
    - Stabilise digits-of-e1
    - Stabilise digits-of-e2
    - Stabilise gen_regexp
    - Adjust runn...
    8632268a