-
Notifications
You must be signed in to change notification settings - Fork 300
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Performance-optimize storing edge partition source/destination properties in (key, value) pairs #2328
Conversation
…edge partition src/dst properties using key, value pairs
…ter performnace measurements)
Codecov Report
@@ Coverage Diff @@
## branch-22.08 #2328 +/- ##
===============================================
Coverage ? 60.74%
===============================================
Files ? 105
Lines ? 5075
Branches ? 0
===============================================
Hits ? 3083
Misses ? 1992
Partials ? 0 Continue to review full report at Codecov.
|
cpp/src/structure/graph_impl.cuh
Outdated
static_cast<double>(num_local_unique_edge_minors) / static_cast<double>(minor_size), | ||
raft::comms::op_t::MAX, | ||
handle.get_stream()); | ||
std::cout << "max_major_properties_fill_ratio=" << max_major_properties_fill_ratio |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Residual debug statement?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Oops, I though I deleted this but it seems like I didn't :-) I will delete this.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Deleted.
@gpucibot merge |
Using (key, value) pairs instead of linear array for the entire source/destination range cuts memory footprint significantly when # GPUs >> (V/E)^2.
This PR performance-optimizes finding the value for the given key and also enables (key, value) pairs (this feature was previously disabled by default).
The original implementation binary searched over the entire set of local source/destination keys. This PR compared a hash table based approach (using cuCollection) and the auxiliary array based approach (described in the original DCSC paper) and selected the auxiliary array based approach.
Breaking due to few graph primitives API changes.