Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Cyph0n
on April 19, 2017
|
parent
|
context
|
favorite
| on:
Cache eviction: when are randomized algorithms bet...
Looks like they just combined LRU + LFU + a victim cache. Or is there something more insightful about its design?
logophobia
on April 19, 2017
[–]
It keeps a history of evicted keys. If there's a miss, it knows if the miss was in the lfu or lru part, and it tunes the ratio of space allocated to the lru and lfu part of the cache.
Cyph0n
on April 19, 2017
|
parent
[–]
Hmm, that sounds pretty cool. The history part is exactly a victim cache, so it seems like the size tuning is what's novel.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: