Major performance improvement for re-ordering of large graphs#4286
Open
garth-wells wants to merge 17 commits into
Open
Major performance improvement for re-ordering of large graphs#4286garth-wells wants to merge 17 commits into
garth-wells wants to merge 17 commits into
Conversation
…arth/gps-optimise
…arth/gps-optimise
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
1 participant
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 GPS algorithm is slow for large meshes because it is close to O(n^2). The PR used RCM as default, which is close to O(n). No detectable performance difference for SpMV or assembly.
On high-end GPU systems with one MPI rank per device, meshes can be large and re-ordering was a significant cost.