Benchmarks - #7
Merged
Merged
Conversation
added 12 commits
June 25, 2026 13:15
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
In this PR i've benchmark
LRU, LFU and Belady's optimal algo.
The file benchmark.cpp generates uniform random numbers [0:100) for input length 100'000.
benchmark/gnuplot script.gpproduces a plot comparing these 3 strategies depending on cache size [10, 20, ... 100]For a cache size 100 any integer random number from 0 to 99 hits a cache, therefore all 3 strategies crosspoint and give cache hit == 99900 (== length - cache_size)