Reduce peak memory requirement of WCC#4990
Merged
rapids-bot[bot] merged 6 commits intorapidsai:branch-25.04from Mar 20, 2025
Merged
Reduce peak memory requirement of WCC#4990rapids-bot[bot] merged 6 commits intorapidsai:branch-25.04from
rapids-bot[bot] merged 6 commits intorapidsai:branch-25.04from
Conversation
… find probably the biggest component)
|
Auto-sync is disabled for draft pull requests in this repository. Workflows must be run manually. Contributors can view more details about this message here. |
…to enh_wcc_memory_requirement
seunghwak
changed the title
…to enh_wcc_memory_requirement
seunghwak
added
improvement
ChuckHastings
approved these changes
Mar 20, 2025
Collaborator
|
/merge |
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
2 participants
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.
If there exists a high degree vertex, run BFS from the highest degree vertex first to possibly find the largest connected component in the graph. BFS uses a visited flag (1 bit) instead of component ID (sizeof(vertex_t)) to store edge end point (src or dst) properties; thus use less memory.
Then, we can create a smaller graph just extracting edges with unvisited endpoints.