Simple and reliable LRU cache for c++ based on hashmap and linkedlist
-
Updated
Jul 29, 2020 - C++
Simple and reliable LRU cache for c++ based on hashmap and linkedlist
C++ cache with LRU/LFU/FIFO policies implementation
💫 A feature complete LRU cache implementation in C++
Greg's Template Library of useful classes.
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.
A C++11 simulator for a variety of CDN caching policies.
Using Belady's algorithm for improved cache replacement
Derive the optimal cache hit ratio for Internet request traces with variable object sizes.
This is our effort to collect the best implementations to tough algorithms. All codes are written in c++.
A concurrency toolbox for c++11, including a cached thread pool executor, a shared timed mutex, a fair semaphore and several other utilities.
This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ language.This FST C++ open source project has much significant advantages.
C++ virtual-array implementation that uses all graphics cards in system as storage (with LRU cache eviction on RAM) and uses OpenCL for data transfers. (Random access: faster than HDD) (Sequential access: faster than SSD) (big objects: faster than NVMe)
A project for Advanced Operating System(CS604) that implements ARC cache replacement policy.
High-performance header-only LRU cache library.
A native module for Node supporting LRU (least-recently-used).
Implemented modern last-level cache(LLC) with the concept of "Perceptron Learning for Reuse Prediction" that use neural network idea, which is training the predictor by a smaller independent cache with a series of features.
A c++ implementation of Adaptive replacement cache (ARC) - a self-tuning ,low-overhead, scan-resistant algo.
Step20 is a C++20, header-only library of STL-like algorithms and data structures
A simulation of the virtual memory. The purpose here is to compare the page replacement and allocation policies.
Add a description, image, and links to the lru-cache topic page so that developers can more easily learn about it.
To associate your repository with the lru-cache topic, visit your repo's landing page and select "manage topics."