coocood/freecache
Freecache
freecache is a high-performance, concurrent in-memory key-value store library for Go applications. It functions as a fixed-size cache that manages large volumes of data while eliminating garbage collection overhead through the use of preallocated memory and off-heap storage.
The system maintains a predictable memory footprint by utilizing fixed memory allocation and circular buffer management, where new entries automatically overwrite the oldest data upon reaching capacity. It further reduces contention between simultaneous readers and writers through lock-striped concurrent access.
The library includes a server interface that implements a subset of the Redis protocol, allowing external clients to communicate with the cache using standard commands and pipelining. Data lifecycle is managed via time-to-live expiration and automated eviction policies.
Features
- Go In-Memory Caches - Provides a high-performance in-memory key-value store for Go applications designed to eliminate garbage collection pauses.
- Cache Eviction Policies - Utilizes cache eviction policies based on expiration timestamps and LRU algorithms to maintain memory limits.
- Concurrent Caches - Provides a thread-safe concurrent cache designed for high-concurrency environments with simultaneous reader and writer access.
- Least Recently Used Caches - Implements a fixed-size cache that discards the oldest or least-recently-used entries when capacity limits are reached.
- Circular Memory Buffers - Utilizes a circular memory buffer to automatically overwrite the oldest data when the fixed cache capacity is reached.
- Off-Heap Memory Managers - Allocates data outside the managed heap to eliminate garbage collection overhead and prevent runtime pauses.
- Slab Allocators - Uses slab allocators with fixed-size chunks to minimize memory fragmentation and ensure a predictable footprint.
- Fixed Memory Buffers - Constrains memory usage to a preallocated fixed size to prevent application crashes and manage data via eviction.
- Memory-Limited Caches - Implements memory-limited caching by capping the total byte size through strictly limited preallocated memory.
- Lock-Striped Sharding - Employs lock-striped sharding to divide the data set and reduce contention among simultaneous readers and writers.
- Concurrent Data Structures - Provides concurrent data structures that ensure thread-safe operations during simultaneous read and write access.
- TTL Expiration Management - Provides TTL expiration management to automatically remove stale cache entries based on timestamps.
- Redis Client Interfaces - Implements a Redis-compatible interface allowing external clients to communicate using standard Redis commands and pipelining.
- Redis Protocol Parsers - Integrates a Redis protocol parser to allow external clients to communicate via standard Redis commands.
- Protocol Servers - Implements a server interface that supports a subset of Redis commands and pipelining for external communication.
- Time-To-Live Expirations - Implements time-to-live expirations to automatically remove stale cache entries and keep data current.
- Caching Libraries - Zero-GC cache library.
Star history
How this analysis was created: This summary and feature list are AI-generated from collected project material and can contain mistakes. Stars, license and language are imported from GitHub. Inclusion does not mean that we have tested or audited this project. Check the source documentation for any feature you depend on. Learn more on our About page.
