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.
-
Updated
Jan 18, 2024 - C++
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.
Add a description, image, and links to the clock-second-chance topic page so that developers can more easily learn about it.
To associate your repository with the clock-second-chance topic, visit your repo's landing page and select "manage topics."
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: