• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

ben-manes / caffeine / 1932 / 1
100%
master: 100%

Build:
DEFAULT BRANCH: master
Ran 18 Dec 2016 08:19AM UTC
Files 66
Run time 2s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

18 Dec 2016 07:39AM UTC coverage: 93.606% (-0.05%) from 93.658%
TERM=dumb

push

travis-ci

ben-manes
Prototype of the sizing the admission window using hill climbing

We know that recency-skewed workloads favor a large window to mimic LRU
and that frequency-skewed workloads favor a smaller window to mimic
LFU. The idea is that we can sample the hit rate, guess an adjustment,
and see how it fares. This gives us a shallow view of the curve, which
would let us climb towards the optimal configuration. If the workload
changes, then the process should restart.

This prototype is basic and the hill climbing algorithm needs fine
tuning. Perhaps using simulated annealing. But it provides the
scaffolding and shows the desired behavior.

Also cleaned up the simulator code. This included removing the "fast
path" evaluation, as the idea didn't improve read concurrency. Renamed
the "adaptive" TinyLfu prototypes to "feedback" so as to not reserve
that name.

5387 of 5755 relevant lines covered (93.61%)

0.94 hits per line

Source Files on job 1932.1 (TERM=dumb)
  • Tree
  • List 0
  • Changed 1
  • Source Changed 0
  • Coverage Changed 1
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Build 1932
  • Travis Job 1932.1
  • 6884b5ee on github
  • Prev Job for TERM=dumb on master (#1931.1)
  • Next Job for TERM=dumb on master (#1935.1)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc