Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Why do you need to use Thrust to do sorting?


Why not? The Thrust folks have done a lot of good work on implementing highly optimized radix sort on GPU.

That said, there is interesting academic work around GPU sort that achieves even higher performance than Thrust in many scenarios, and we are looking at the feasibility of incorporating a framework we have found particularly promising.


Can thrust sort operate on datasets larger than GPU and CPU memory or does it require manually combining smaller sort operations into larger sorted sequences akin to merge sort?


Can you share the academic work you're referring to? Would be interested to read more.


Elias Stehle's work out of Technical University of Munich is pretty awesome, see here: https://dl.acm.org/citation.cfm?id=3064043.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: