Open
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.
Start of the Paper on HMM and Kokkos.
The main focus of the paper is the question: "In which circumstances is the way we currently teach (two allocations for host and device and explicit deep_copies) the fastest way to write performance portable code." Since HMM came up and was integrated into the toolchains by Nvidia and AMD, system allocations and implicit memory movement are an option. This might have benefits based on access patterns and data layouts as well as on the bytes per flop in kernels. Synchronization is still required to be done manually but depending on the algorithm and datasizes it might be negligible.
Includes benchmark Vector_ping_pong for benchmarking the impact of using two arrays (how we teach) vs using automatic page migration (via
new,malloc, ormanaged).TODO: