Simple implementation of LRU in Python.
-
Updated
Jan 22, 2018 - Python
Simple implementation of LRU in Python.
These are the Python implementations of FIFO, LRU and OPT page replacement algorithms
A straightforward implementation of a least recently used (LRU) cache using JavaScript's Map 🗺️
A C program that simulates an L1 cache. Uses the Least Recently Used replacement policy. Set associative.
golang-lru,simple switching between LRU,Cache,TwoQueueCache and ARCCache.
Implementation of some advanced caching policies
A direct-mapped cache for variable-length arrays with least recently used replacement and static allocation.
A threadsafe map-like container implementing a least-recently-used cache
Simulation of Virtual Memory Paging Algorithms
Implementation of various page replacement policies including First in First out (FIFO), Least Recently Used (LRU), Approximate LRU and Random.
Thread-safe LRU cache implementation
Memory management simulator, using Hashed Page Table. Page Replacement Algorithms: Least Recently Used (LRU) and Second Chance.
A thread-safe, hash-mapped LRU cache instance
LRU Stands for Least Recently Used and LRU Cache help identify the least recently used items in a System.
"Least Recently Used" (LRU) cache compatible to ES6 Map
Java based cache implementations
This repository contains the Python Programs for various algorithms of Operating Systems
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.
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."