Add heuristic approach to assign edge-based partition IDs #3813
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
that minimize number of faked source/destination nodes in the edge case: a single backward edge will be placed in other than node u partion
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.
Issue
Add heuristic approach to assign edge-based partition IDs that minimize number of faked source/destination nodes that not actual source (have a row with all invalid edge weights in the cell storage) or destination (have a column with all invalid edge weights in the cell storage) nodes in the the following case: a single backward edge-based edge that goes backward into a boundary edge will be placed in the partition of the other node-based node partition.
This gives the following improvements in number of unconnected nodes (
[warn] Node needs to either have incoming or outgoing edges in cell. Number of unconnected nodes is 2):Tasklist
Requirements / Relations
#3205, #3731