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

Jump to bottom

question about 'divisible by some large powers of two' in 'Cache Associativity' section #228

Open

sci-42ver opened this issue Jun 3, 2023 · 0 comments

sci-42ver commented Jun 3, 2023

in 'Cache Associativity', the author says:

When the array size is a multiple of a large power of two, then the indices of the “hottest” elements, the ones we likely request on the first dozen or so iterations, will also be divisible by some large powers of two and map to the same cache line — kicking each other out and causing a ~20% performance decrease.

I think only index subbits are related whether memory should be stored to the same set, while this doesn't imply one divisibility relation

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment