There are 0 repository under least-recently-used topic.
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
High performing caching package for node/javascript
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.
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 straightforward implementation of a least recently used (LRU) cache using JavaScript's Map 🗺️
"Implementation of Virtual Memory available in operating systems"
A direct-mapped cache for variable-length arrays with least recently used replacement and static allocation.
Implementation of some advanced caching policies
In-memory LRU Cache implementation using multiple Design Patterns
A C program that simulates an L1 cache. Uses the Least Recently Used replacement policy. Set associative.
A configurable two-level cache (for caching Objects). Level 1 is memory, level 2 is filesystem. One can specify cache strategies and max sizes of both levels 1 and 2. Three cache replacement policies have been set: Least Frequently Used, Least Recently Used, Most Recently Used.
Implementation and comparison of various caching policies, on different type of workloads
Implementation of various page replacement policies including First in First out (FIFO), Least Recently Used (LRU), Approximate LRU and Random.
Template implementation of a dynamically memory allocated linked list cache using the least recently used (LRU) algorithm.
Simple implementation of LRU in Python.
"Least Recently Used" (LRU) cache compatible to ES6 Map
Java based cache implementations
A thread-safe, hash-mapped LRU cache instance
Thread-safe LRU cache implementation
Dump for all Operating System Lab Codes
Page replacement algorithms for memory management in operating systems
Cashed is an LRU based caching service written in plain c.
LRU Stands for Least Recently Used and LRU Cache help identify the least recently used items in a System.