better for cache #564
Open
better for cache #564
Conversation
This file contains 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
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.
2-d arrays, with sizes like A[n][2^x] are much slower, than the same arrays, but with B[n][2^x + 1] sizes, due to cache misses.
I'm not sure, how to benchmark commit the right way, but on my machine I got:
My branch
5: 13231 nodes 287630 nps
10: 88205 nodes 541134 nps
13: 259811 nodes 604211 nps
15: 519805 nodes 642527 nps
20: 2815782 nodes 653616 nps
Main branch
5: 13231 nodes 281510 nps
10: 88205 nodes 569064 nps
13: 259811 nodes 618597 nps
15: 519805 nodes 665563 nps
20: 2815782 nodes 670583 nps
Left number is depth of benchmark.