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

summarize discussion about reduction algortihm, determinism etc... #20

Open

mtaillefumier opened this issue Jan 31, 2024 · 0 comments

mtaillefumier commented Jan 31, 2024

we had long discussion on the 29th about the reduction algorithm that extended to the two versions of determinism, the strong vs weak implementation.

refs :
https://groups.csail.mit.edu/commit/papers/09/asplos073-olszewski.pdf
https://onlinelibrary.wiley.com/doi/full/10.1002/cpe.7763
https://www.physicsforums.com/threads/parallel-kahan-summation.716446/ (Kahan sum in parallel)
https://indico.fnal.gov/event/57249/contributions/270632/attachments/169825/228082/reproduciblity_lattice2023.pdf (kate talk)
https://developer.download.nvidia.com/assets/cuda/files/reduction.pdf (Mark harris talk about reduction, perf oriented)

we must distinguish between reproducibility and error minimization.

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