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.

Trace-driven cache memory simulator with LRU, MRU, RR and Belady replacement policies.

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

High performing caching package for node/javascript

Memory management simulator, using Hashed Page Table. Page Replacement Algorithms: Least Recently Used (LRU) and Second Chance.

golang-lru,simple switching between LRU,Cache,TwoQueueCache and ARCCache.

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.

Mudis is a fast, thread-safe, in-memory, sharded LRU cache for Ruby applications. Rails and Hanami (or any Rack) compatible.

A threadsafe map-like container implementing a least-recently-used cache

"Implementation of Virtual Memory available in operating systems"

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 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.

Implementation of some advanced caching policies

In-memory LRU Cache implementation using multiple Design Patterns

Simple implementation of LRU in Python.

Contains the Python implementation of the following Page Replacement Algorithms: 1. FIFO Page Replacement 2. LRU Page Replacement 3. Optimal Page Replacement