[
https://issues.apache.org/jira/browse/ARROW-10899?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17324878#comment-17324878
]
Kirill Lykov edited comment on ARROW-10899 at 4/19/21, 8:55 AM:
----------------------------------------------------------------
Updates, I've contacted Travis and he wrote that he has a lack of time to work
on it yet it seems interesting to him. He mentioned also that MSD
implementation might be better for bandwidth.
I'm thinking about the way to proceed. One option might be
1. Travis will create a PR just with his radix sort implementation
2. I will add tests and benchmarks to his PR
One thing which kind of worries me is that sorting requires quite intense
ad-hoc testing and benchmarking, are we fine with adding all these to the Arrow
repository?
was (Author: klykov):
Updates, I've contacted Travis and he wrote that he has a luck of time to work
on it yet it seems interesting to him. He mentioned also that MSD
implementation might be better for bandwidth.
I'm thinking about the way to proceed. One option might be
1. Travis will create a PR just with his radix sort implementation
2. I will add tests and benchmarks to his PR
One thing which kind of worries me is that sorting requires quite intense
ad-hoc testing and benchmarking, are we fine with adding all these to the Arrow
repository?
> [C++] Investigate radix sort for integer arrays
> -----------------------------------------------
>
> Key: ARROW-10899
> URL: https://issues.apache.org/jira/browse/ARROW-10899
> Project: Apache Arrow
> Issue Type: Wish
> Components: C++
> Reporter: Antoine Pitrou
> Assignee: Kirill Lykov
> Priority: Major
> Attachments: Screen Shot 2021-02-09 at 17.48.13.png, Screen Shot
> 2021-02-10 at 10.58.23.png, all_random_wholeRange.png
>
>
> For integer arrays with a non-tiny range of values, we currently use a stable
> sort. It may be faster to use a radix sort instead.
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
