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.
This repository contains the Python Programs for various algorithms of Operating Systems
These are the Python implementations of FIFO, LRU and OPT page replacement algorithms
Trace-driven cache memory simulator with LRU, MRU, RR and Belady replacement policies.
High performing caching package for node/javascript
golang-lru,simple switching between LRU,Cache,TwoQueueCache and ARCCache.
Memory management simulator, using Hashed Page Table. Page Replacement Algorithms: Least Recently Used (LRU) and Second Chance.
Simulation of Virtual Memory Paging Algorithms
Asynchronous cache that implements Least Recently Used (LRU) - Clock - Second Chance algorithm with O(1) hit O(1) miss complexity. This Async cache hides latency of cache-misses behind each other and behind cache-hits.
A threadsafe map-like container implementing a least-recently-used cache
This is an implementation of the Least Recently Used (LRU) page replacement algorithm.
A direct-mapped cache for variable-length arrays with least recently used replacement and static allocation.
A C program that simulates an L1 cache. Uses the Least Recently Used replacement policy. Set associative.
A straightforward implementation of a least recently used (LRU) cache using JavaScript's Map 🗺️
Implementation of some advanced caching policies
In-memory LRU Cache implementation using multiple Design Patterns
A thread-safe, hash-mapped LRU cache instance
Cashed is an LRU based caching service written in plain c.
Simple implementation of LRU in Python.
Implementation and comparison of various caching policies, on different type of workloads
Add a description, image, and links to the least-recently-used topic page so that developers can more easily learn about it.
To associate your repository with the least-recently-used topic, visit your repo's landing page and select "manage topics."