A thread-safe, hash-mapped LRU cache instance
-
Updated
Jun 11, 2021 - Go
A thread-safe, hash-mapped LRU cache instance
Simple implementation of LRU in Python.
Implementation and comparison of various caching policies, on different type of workloads
Page replacement algorithms for memory management in operating systems
Cashed is an LRU based caching service written in plain c.
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.
Template implementation of a dynamically memory allocated linked list cache using the least recently used (LRU) algorithm.
Dump for all Operating System Lab Codes
Thread-safe LRU cache implementation
"Least Recently Used" (LRU) cache compatible to ES6 Map
Implementation of various page replacement policies including First in First out (FIFO), Least Recently Used (LRU), Approximate LRU and Random.
LRU Stands for Least Recently Used and LRU Cache help identify the least recently used items in a System.
Java based cache implementations
Implementation of some advanced caching policies
"Implementation of Virtual Memory available in operating systems"
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 🗺️
In-memory LRU Cache implementation using multiple Design Patterns
This is an implementation of the Least Recently Used (LRU) page replacement algorithm.
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."