Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Mention that eviction policies use approximated randomized algorithms #144

Merged
merged 2 commits into from
Jun 17, 2024
Merged

Mention that eviction policies use approximated randomized algorithms #144

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
1d4039b
Both LRU, LFU and volatile-ttl are implemented using approximated ran…
enjoy-binbin Jun 17, 2024
326ebde
Update topics/lru-cache.md
enjoy-binbin Jun 17, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions topics/lru-cache.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -57,6 +57,8 @@ The following policies are available:

The policies **volatile-lru**, **volatile-lfu**, **volatile-random**, and **volatile-ttl** behave like **noeviction** if there are no keys to evict matching the prerequisites.

Both **LRU**, **LFU** and **volatile-ttl** are implemented using approximated randomized algorithms.
enjoy-binbin marked this conversation as resolved.
Show resolved Hide resolved

Picking the right eviction policy is important depending on the access pattern
of your application, however you can reconfigure the policy at runtime while
the application is running, and monitor the number of cache misses and hits
Expand Down