A low-latency LRU approximation cache in C++ using CLOCK second-chance algorithm. Multi level cache too. Up to 2.5 billion lookups per second.
fast caching benchmark memoization cpp high-performance cache lru data-structures low-latency fastest high-throughput lru-cache cache-simulator multi-level-cache low-latency-queries least-recently-used set-associative-cache direct-mapped-cache clock-second-chance
-
Updated
Jan 18, 2024 - C++