-
Notifications
You must be signed in to change notification settings - Fork 197
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
[REVIEW] Scaling knn graph fix connectivities algorithm #181
[REVIEW] Scaling knn graph fix connectivities algorithm #181
Conversation
rerun tests |
1 similar comment
rerun tests |
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.
Looks great and mostly small comments/questions! Happy to iterate on this today and get it in before the weekend
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.
LGTM, since we are trying to get this code copied over from cuML for SLHC to make 0.19. May target cleanup in 0.20. Thanks, Corey!
@gpucibot merge |
Use raft's large workspace resource for large temporary allocations during ANN index build. This is the port of rapidsai#2194, which didn't make into raft before the algorithms were ported to cuVS. Authors: - Artem M. Chirkin (https://github.com/achirkin) Approvers: - Tamas Bela Feher (https://github.com/tfeher) URL: rapidsai/cuvs#181
This PR reduces unecessary memory usage while connecting a KNN graph by normalizing colors so they are drawn from a monotonically increasing set.