anchor.diff:  
   handle_overload_info(_, _Idx) ->
       ok.
  +
  +%% We calculate the jitter (end) for a cache by reducing it to (at maximum)
  +%% half the size.
  +
  +-spec cache_end(pos_integer(), pos_integer()) -> pos_integer().
  +cache_end(Start, CacheSize) ->
  +    Jitter = rand:uniform(CacheSize div 2),
  +    Start + CacheSize - Jitter.
  
positive.code:                     k6_bytea:set(Array, 0, Value),
                      k6_bytea:set(Array, Len * ?DATA_SIZE,
                                   <<0:(?DATA_SIZE * 8 * (CacheSize - Len))>>),
                      ets:update_element(T, BM, [{2, Time}, {3, Len},
                                                 {4, Time + CacheSize}]),
                      metric_io:write(IO, Bucket, Metric, Start, Bin);
                  %% In the case the data is already longer then the cache we
                  %% flush the cache
  
negative.code:                 [] when Len < CacheSize ->
                      Array = k6_bytea:new(CacheSize * ?DATA_SIZE),
                      k6_bytea:set(Array, 0, Value),
                      End = cache_end(Time, CacheSize),
                      ets:insert(T, {BM, Time, Len, End, Array});
                  %% If we don't have a cache but our data is too big for the
                  %% cache we happiely write it directly
                  [] ->
  