-
Notifications
You must be signed in to change notification settings - Fork 304
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
[ENH] Graph primitives performance improvement #1442
Milestone
Comments
rapids-bot bot
pushed a commit
that referenced
this issue
Apr 6, 2021
Partially addresses Issue #1442 Update graph partitioning scheme to better control memory footprint vs concurrency trade-offs for large-scale graph processing in large clusters. This new partitioning scheme also simplifies communication patterns among GPUs which can potentially improve scalability. Authors: - Seunghwa Kang (https://github.com/seunghwak) Approvers: - Chuck Hastings (https://github.com/ChuckHastings) - Alex Fender (https://github.com/afender) - Andrei Schaffer (https://github.com/aschaffer) URL: #1443
rapids-bot bot
pushed a commit
that referenced
this issue
Apr 7, 2021
…rtex degrees (#1447) Partially addresses Issue #1442 Update graph primitives used by PageRank, Katz Centrality, BFS, and SSSP to launch 3 different kernels based on vertex degrees to address thread divergence issue. In addition, cut memory footprint of the VertexFrontier class used by BFS & SSSP. The following highlights performance improvement with this optimization. R-mat 2^25 vertices 2^25 * 32 edges PageRank: 7.66, 7.42, 8.83, 8.83 seconds (the first two unweighted, the last two weighted, first & third without personalization)=> 1.07, 1.08, 1.36, 1.39 seconds Katz: 1.08, 1.94 seconds (unweighted, weighted)=> 0.243, 0.275 BFS: 1.32 seconds=> 0.251 R-mat 2^25 vertices 2^25 * 16 edges SSSP: 1.89 seconds (memory allocation fails with the edge factor of 32)=> 0.317 And now SSSP also works with 2^25 vertices 2^25 * 32 edges with the memory footprint improvement and it took 0.514 sec. Still needs additional optimizations to reach the target performance 1. add BFS & SSSP specific optimizations (the current implementation assumes general reduction operations while BFS can pick any source vertex if a vertex is discovered by multiple source vertices and SSSP picks the one with the minimum edge weight, these pure function reduction operations allow additional optimizations). 2. Launch 3 different kernels in multiple streams to recover parallelism when the frontier size is relatively small (currently three kernels are queued in a single stream, and this leads to up to 3x decrease in parallelism) Authors: - Seunghwa Kang (https://github.com/seunghwak) Approvers: - Alex Fender (https://github.com/afender) - Chuck Hastings (https://github.com/ChuckHastings) - Brad Rees (https://github.com/BradReesWork) URL: #1447
This issue has been labeled |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Describe the solution you'd like
Performance optimize graph primitives.
In short term, we need to
The text was updated successfully, but these errors were encountered: