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

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

High performing caching package for node/javascript

These are the Python implementations of FIFO, LRU and OPT page replacement algorithms

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.

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

This is an implementation of the Least Recently Used (LRU) page replacement algorithm.

"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

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.

In-memory LRU Cache implementation using multiple Design Patterns

Cashed is an LRU based caching service written in plain c.

Java based cache implementations

Simple implementation of LRU in Python.