sssp implementation in charm4py #275
Open
+156
−0
Conversation
This file contains 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
ritvikrao
requested review from
matthiasdiener,
lvkale,
adityapb,
ZwFink and
mayantaylor
|
Have you tested at some reasonable scale (for both graph size and number of pes)? |
I have so far run up to 2M edges on 48 PEs. |
adityapb
reviewed
Sep 18, 2024
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.
I added a single-source shortest paths (SSSP) example in Charm4Py. You provide a number of vertices, a number of edges, a random seed, and a source vertex. A graph is automatically generated, and then a parallel Bellman-Ford SSSP algorithm is executed on that graph.