faster vqsort when <4 keys per vector: add new Sort16Rows cases to BaseCase - #3286
Open
a-eridani wants to merge 1 commit into
Open
faster vqsort when <4 keys per vector: add new Sort16Rows cases to BaseCase#3286a-eridani wants to merge 1 commit into
a-eridani wants to merge 1 commit into
Conversation
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
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.
I added sorting networks for cases, when <4 keys fits the register. BaseCase::funcs:
Also, kLPK in BaseCaseNumLanes is no longer needed, because cases for <4 added. I removed it.
bench_sort: for n <= 128 a single bench is terrible noisy, so now 30 sorts of 30 different buffers are measured for them in one measurement.
Final speedup(I alternated many benches and took the median, apple m5)
for n=1e4 i used uniform32.
Other types remain unchanged