Skip to content

Potential fix for 1 code quality finding #41

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

Merged
TKorr merged 1 commit into from
Mar 1, 2026
Merged

Potential fix for 1 code quality finding #41

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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: 1 addition & 1 deletion docs/policies/roadmap/sieve.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,5 +29,5 @@ This creates low-cost second-chance behavior without maintaining full LRU order.
- Benchmark against `S3-FIFO`, `Clock`, and `LRU` on scan-heavy mixes.

## References
- SIEVE policy publication and follow-up implementation notes.
- Zhang et al. (2023): "SIEVE is Simpler than LRU: an Efficient Turn-Key Eviction Algorithm for Web Caches", in *Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS)*.
- Wikipedia (taxonomy context): https://en.wikipedia.org/wiki/Cache_replacement_policies