Dan Luu personal blog
Cache Eviction: When Are Randomized Algorithms Better Than LRU? (2014)
Once upon a time, my computer architecture professor mentioned that using a random eviction policy for caches really isn't so bad. That random eviction isn't bad can be surprising — if your cache fills up and you have to get rid of something, choosing the least recently used (LRU) is an obvious choice, since you're…
- Points
- 235
- HN comments
- 138
- Submissions
- 4
- Cited by
- 4 commenters
Systems & PerformanceMath & Algorithms2019
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Feb 18, 2019 | Cache Eviction: When Are Randomized Algorithms Better Than LRU? (2014) by zwliew | 235 | 42 |
| Apr 19, 2017 | Cache eviction: when are randomized algorithms better than LRU? (2014) by signa11 | 192 | 67 |
| Jan 22, 2024 | Caches: LRU vs. Random (2014) by eatonphil | 92 | 26 |
| Nov 4, 2014 | Cache Eviction: When Are Randomized Algorithms Better Than LRU? by luu | 57 | 3 |
Cited in comments
Linked from 4 Hacker News comments by 4 different people, from Jun 2017 to Sep 2025.
Most recent:
- bob1029 · Sep 14, 2025
- thesz · Jan 3, 2024
- ignoramous · Dec 24, 2019
- alxv · Jun 26, 2017
