NONovaX·Jan 9, 2024
Or the author’s simulator if you prefer C. See their hyperbolic for an example.
https://github.com/1a1a11a/libCacheSim/blob/develop/libCache...
In Why Aren't We Sieve-Ing?1a1a11a
libCacheSim
C++2023–2024
1a1a11a / libCacheSim
libCacheSim
a high performance library for building cache simulators
2Distinct people
3Mentions
0Explicit recommenders
363GitHub stars
What to know before exploring
What it is
a high performance library for building cache simulators
GitHub
Where it is used
No documented product use has been verified yet.
What people are saying
No recommendation phrase was found in the indexed comments.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
No other repository is repeatedly linked in the same discussions.
This week on Hacker News
Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.
No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.
Mentions over time
HN mentions by day3 dated mentions
Observed mentions: 2023-12-23 22:46:33 UTC to 2024-01-09 17:17:36 UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| Dec 23 | 2023-12-23 00:00:00 UTC | 2023-12-24 00:00:00 UTC | 1 | 0 | 1 |
| Dec 24 | 2023-12-24 00:00:00 UTC | 2023-12-25 00:00:00 UTC | 0 | 0 | 0 |
| Dec 25 | 2023-12-25 00:00:00 UTC | 2023-12-26 00:00:00 UTC | 0 | 0 | 0 |
| Dec 26 | 2023-12-26 00:00:00 UTC | 2023-12-27 00:00:00 UTC | 0 | 0 | 0 |
| Dec 27 | 2023-12-27 00:00:00 UTC | 2023-12-28 00:00:00 UTC | 0 | 0 | 0 |
| Dec 28 | 2023-12-28 00:00:00 UTC | 2023-12-29 00:00:00 UTC | 0 | 0 | 0 |
| Dec 29 | 2023-12-29 00:00:00 UTC | 2023-12-30 00:00:00 UTC | 0 | 0 | 0 |
| Dec 30 | 2023-12-30 00:00:00 UTC | 2023-12-31 00:00:00 UTC | 0 | 0 | 0 |
| Dec 31 | 2023-12-31 00:00:00 UTC | 2024-01-01 00:00:00 UTC | 0 | 0 | 0 |
| Jan 1 | 2024-01-01 00:00:00 UTC | 2024-01-02 00:00:00 UTC | 0 | 0 | 0 |
| Jan 2 | 2024-01-02 00:00:00 UTC | 2024-01-03 00:00:00 UTC | 0 | 0 | 0 |
| Jan 3 | 2024-01-03 00:00:00 UTC | 2024-01-04 00:00:00 UTC | 0 | 0 | 0 |
| Jan 4 | 2024-01-04 00:00:00 UTC | 2024-01-05 00:00:00 UTC | 0 | 0 | 0 |
| Jan 5 | 2024-01-05 00:00:00 UTC | 2024-01-06 00:00:00 UTC | 0 | 0 | 0 |
| Jan 6 | 2024-01-06 00:00:00 UTC | 2024-01-07 00:00:00 UTC | 0 | 0 | 0 |
| Jan 7 | 2024-01-07 00:00:00 UTC | 2024-01-08 00:00:00 UTC | 1 | 0 | 1 |
| Jan 8 | 2024-01-08 00:00:00 UTC | 2024-01-09 00:00:00 UTC | 0 | 0 | 0 |
| Jan 9 | 2024-01-09 00:00:00 UTC | 2024-01-10 00:00:00 UTC | 1 | 0 | 1 |
What Hacker News says
3 sourcesI had a try on a few traces; the random two-choice algorithm is only better when there is a big scan, and the LRU miss ratio curve shows a cliff. In all other cases, it is worse than LRU eviction.
Implementation can be found
https://github.com/1a1a11a/libCacheSim/blob/develop/libCache...
In Sieve is simpler than LRU/u/someplaceguy,
Those LIRS traces, along with many others, are available at this page [1]. I did a cursory review using their traces with Caffeine's and the author's simulators to avoid bias or a mistaken implementation. In their target workloads Caffeine was on par or better [2]. I have not seen anything novel in this or their previous works and find their claims to be easily disproven, so I have not implement this policy in Caffeine’s simulator yet.
[1]: https://github.com/ben-manes/caffeine/wiki/Simulator
[2]: https://github.com/1a1a11a/libCacheSim/discussions/20
In Otter, Fastest Go in-memory cache based on S3-FIFO algorithm