Repository navigation
Add the Base/Tiling tutorial - #189
Merged
Merged
Conversation
The boxes an MFIter loop works on and the bugs of picking the wrong one. The program prints tilebox, validbox, fabbox, growntilebox and nodaltilebox for one box, then counts how many times each cell is written with each choice: tilebox and growntilebox visit every cell once; validbox in a tiled loop visits each cell once per tile; a tile box grown or converted by hand overlaps the neighboring tiles; tilebox in per-box bookkeeping records one tile instead of the box. It ends with a Laplacian timed with and without tiling. Tested with GNU Make in 3D with OpenMP (2 ranks x 4 threads, 1 rank x 1 thread, tile_size=1024000^3), in 2D with MPI, and in 3D with CUDA.
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.
The boxes an MFIter loop works on and the bugs of picking the wrong one. The program prints tilebox, validbox, fabbox, growntilebox and nodaltilebox for one box, then counts how many times each cell is written with each choice: tilebox and growntilebox visit every cell once; validbox in a tiled loop visits each cell once per tile; a tile box grown or converted by hand overlaps the neighboring tiles; tilebox in per-box bookkeeping records one tile instead of the box. It ends with a Laplacian timed with and without tiling.
Tested with GNU Make in 3D with OpenMP (2 ranks x 4 threads, 1 rank x 1 thread, tile_size=1024000^3), in 2D with MPI, and in 3D with CUDA.