#
lfu
Here are 31 public repositories matching this topic...
A powerful caching library for Python, with TTL support and multiple algorithm options.
memoization
algorithm
functional-programming
cache
lru
extensible
decorator
extendable
ttl
fifo
lru-cache
memoize-decorator
memoization-library
fifo-cache
lfu-cache
lfu
ttl-cache
cache-python
python-memoization
ttl-support
-
Updated
Dec 19, 2020 - Python
High performing caching package for node/javascript
javascript
lru
lru-cache
cache-replacement
lfu-cache
node-cache
lfu
cache-engine
least-recently-used
least-frequently-used
custom-hashtable
-
Updated
May 18, 2021 - JavaScript
Least Frequently Used Erlang Implementation
internal
unix
algorithm
erlang
tcp
unix-domain-socket
lfu
ranch
processes-counters
lfu-algorithm
quadrillion-hits
key-counters
store-counters
interaction-protocol
order-counters
-
Updated
Jan 10, 2021 - Erlang
LFU implemented in very basic (no interior mutability)
-
Updated
Dec 1, 2020 - Rust
Computer science 2nd semester @ LFU Innsbruck
-
Updated
Jun 16, 2017 - Java
This Repo contains basic modules like Use of Kernel level Libraries, Random Number generation, Heap Memory Module implementation via best-fit,first-fit,Buddy Systems,Virtual Memory Mechanisms FIFO,LFU,MFU, Process deadlock Mechanism Detection
kernel-module
fifo
deadlock-detection
mfu
heap-memory
lfu
buddy-system-allocation
best-first-search
best-fit
first-fit
-
Updated
May 3, 2020 - Makefile
Test task on LRU and LFU caching implementation in JAVA.
-
Updated
Apr 9, 2021 - Java
Cache memory with LRU, LFU, LIFO and FIFO politics
-
Updated
Jul 23, 2020 - Objective-C
-
Updated
Apr 17, 2020 - C++
1. 操作系统学习。基于Python 3构建部分 os 算法.包括：缓存置换算法LRU，LFU，FIFO；异步任务线程池、LeetCode-python部分题解；2. 计算机网络原理学习。基于 Python 3 库对 TCP/UDP 数据段解析；3. 计算机组成原理
-
Updated
Nov 15, 2020 - Python
sync.Map wrapper with transactions, autoexpiry, capacity limit and FIFO or LFU eviction policy.
go
map
golang
sync
queue
cache
transaction
fifo
expiry
orderedmap
lfu-cache
lfu
eventually-consistent
capacity
eviction-callback
-
Updated
Jul 15, 2021 - Go
golang cache interface and some algorithm implementation
-
Updated
Apr 28, 2021 - Go
A simulation of various page replacement algorithms
-
Updated
Aug 5, 2018 - C
Improve this page
Add a description, image, and links to the lfu topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the lfu topic, visit your repo's landing page and select "manage topics."
Consider an LFU cache with
capacity=10i.eThe internal
cache.freqListis a linked list. Each of its entries represent a given frequency along with a map (bucket) with all the items with such frequency.The issue is that we never clean-up empty entries, over time the list grows larger and larger. It's not great.
Example:
W