lru-implementation

One of The Fastest Zero Alloc LRU Cache for Golang (Go). Maximizes memory use, no garbage collection issues. Use memory size limit instead of specifying item capacity. Batch eviction feature for faster processing

An implementation of LRU Cache using Doubly Linked Lists and Maps with O(1) read and write time complexity. [500+ NPM Downloads]

A cross-platform, multi-core optimized C++20 LRU Hash Table featuring zero runtime allocations, custom TTAS spinlocks, and Windows Kernel support.

Simple cache implementation on java

Implementation and analysis of cache replacement policies (Random and Least Recently Used) in a C++-based cache simulator. This project explores cache architecture behavior, evaluates eviction strategies, and measures performance metrics such as cache hits, misses, and flush counts.

Simple implementations of LRU / LFU cache.

A LRU cache implemented using object oriented approach

Different implementations of LRU Page Replacement algorithm and their results

cachify is a lightweight, high-performance, thread-safe Least Recently Used (LRU) cache library for Go. It is designed for in-memory caching with optional support for expiration, eviction callbacks, and dynamic capacity adjustment.

In memory Go implementation of LRU Cache

A performance‑focused tool for analyzing caching strategies and memory usage. SmartCacheAnalyzer helps evaluate cache efficiency, detect bottlenecks, and optimize resource management with clear insights. Built using modern development practices to support learning and experimentation in system optimization.

Thread-safe LRU caching governed by an explicit byte budget