Ballerina cache Module
-
Updated
Jun 26, 2024 - Ballerina
Ballerina cache Module
about algorithm data structure, now has lru/lru-k/lfu/slab/rbtree/timerwheel with ttl, 关于算法常用的数据结构
a high performance library for building cache simulators
High performance, thread-safe in-memory caching primitives for .NET
A Time-aware Least Recently Used cache implementation in Go with configurable eviction policy
Simple cache implementation on java
A powerful caching library for Elixir with support for transactions, fallbacks and expirations
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
High performance and lightweight in-memory cache library with LRU and FIFO support as well as memory-usage-based-eviction
Page Replacement Algorithms manage memory efficiently in computer systems. FIFO (First In, First Out) replaces the oldest page, simple but inefficient. Optimal replaces the page that won't be used for the longest time, ideal but impractical. LRU (Least Recently Used) swaps out the least recently accessed page, balancing simplicity and effectiveness
Add a description, image, and links to the lru topic page so that developers can more easily learn about it.
To associate your repository with the lru topic, visit your repo's landing page and select "manage topics."