Argsort Adaptation

Question

Argsort Adaptation

Closed this issue a year ago · 8 comments

Amazing work! I was wondering if it would be possible to adapt the qsort kernels for an argsort. So also returning the indices that would make the original array sorted. (I believe you can do this with std::sort by sorting pair<value, size_t> where size_t is the original index) Would love to help out if it's feasible!

Answer 1 · 2023-02-17T18:05:24.000Z

Hi, we are working on adding key-value sort (see PR #2) and I want to add argsort as well. Pull requests are welcome if you want to work on it!

Answer 2 · 2023-02-17T18:21:26.000Z

@r-devulap Amazing! I'll wait till that lands and then help out

Answer 3 · 2023-04-29T21:38:35.000Z

See #34 @samster25

Answer 4 · 2023-05-01T22:30:09.000Z

Thanks @r-devulap Will looking into integration!

Answer 5 · 2023-05-18T16:14:01.000Z

@samster25 argsort for 32-bit and 64-bit dtype has been merged. Were you able to integrate it? Just curious to hear your feedback and what sort of workload you are using it in.

Answer 6 · 2023-05-22T16:22:08.000Z

Closed, as completed.

Answer 7 · 2023-05-22T20:10:25.000Z

Hi @r-devulap, Sorry for the delay. I was planning on taking a look in our next sprint! Our plan is to build a Rust crate that wraps this code base. Our use case is we're building a Distributed DataFrame called daft (built in Rust) and we would love to leverage SIMD for our sorts and partitioning algorithms. Thanks again for the hardwork! :)

Answer 8 · 2023-07-10T18:45:44.000Z

@samster25 quick ping to check if you have had time to use any of the simd sort methods in daft?