You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We benchmark the performance of cuvs for large topk(k > 1024). We find that the speed is much slower compared to the cases for k < 1024. We find that the search algorithm used for k > 1024 is MULTI_KERNEL instead of single/multi-cta.
We have three questions.
Will you please explain why single/multi-cta algorithms cannnot support large k?
How can we improve the performance for k > 1024?
Do you have a plan to support k > 1024 for single/multi-cta algorithms in the near future?
The text was updated successfully, but these errors were encountered:
What is your question?
We benchmark the performance of cuvs for large topk(k > 1024). We find that the speed is much slower compared to the cases for k < 1024. We find that the search algorithm used for k > 1024 is MULTI_KERNEL instead of single/multi-cta.
We have three questions.
The text was updated successfully, but these errors were encountered: