Skip to content

use SIMD.jl for explicit vectorization of partial operations #557

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.

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
merged 1 commit into from
Nov 19, 2021

Conversation

KristofferC
Copy link
Collaborator

@KristofferC KristofferC commented Nov 19, 2021

Alternative to #555

Co-authored-by: Yingbo Ma [email protected]

Using the benchmark in #555

I extracted the code from the benchmark in #555 (https://gist.github.com/KristofferC/a3915eec407491b7a4fc8a7d81c16fbe) and put it into https://uica.uops.info/. The result is (with some various tools) in cycles per iteration:

Explicit:

uiCA | 265.50
IACA 3.0 | 245.00
llvm-mca | 210.06

Master:

uiCA | 371.00
IACA 3.0 | 318.00
llvm-mca | 263.11

So it does seem that the strategy in #555 is quite good.

@KristofferC
Copy link
Collaborator Author

Since this seems to have the same performance improvements as #555 (and also some better compile-time behavior) as well as not having to duplicate all the llvmcall logic that exists in SIMD.jl I think it is better to go with this one.

@KristofferC KristofferC merged commit d033d2a into master Nov 19, 2021
@KristofferC KristofferC deleted the kc/vec branch November 19, 2021 17:54
KristofferC added a commit that referenced this pull request Dec 13, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant