Skip to content
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

Detect fast-math reductions #41

Open
simoll opened this issue Aug 7, 2019 · 0 comments
Open

Detect fast-math reductions #41

simoll opened this issue Aug 7, 2019 · 0 comments

Comments

@simoll
Copy link
Member

simoll commented Aug 7, 2019

The reduction analysis/codegen in RV makes no distinction between ordered (strict) and un-ordered reductions, neither during reduction detection, not during codegen.
This should be improved to enable:

1.) in-order reductions (that is do not privatize the accumulation variable(s), reduce in every loop iteration using a strict reduction
2.) fast-math reduction (privatize the accumulator, reduce using an unordered, fast-math reduction).

RV currently employs an inconsistent mix of these two where reductions are privatized in SIMD code but the generated reduction code does not use the fast-math flags.

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

No branches or pull requests

1 participant