no way to compare when less than two revisions
Differences
This shows you the differences between two versions of the page.
— | hybrid_sort [2018/10/03 17:55] (current) – created - external edit 127.0.0.1 | ||
---|---|---|---|
Line 1: | Line 1: | ||
+ | ====== Hybrid Sort ====== | ||
+ | Sorting is a general problem widely used in computer science. Sorting can achieve high performance, | ||
+ | We would like to acknowledge Erik Sintorn and Ulf Assarsson at Chalmers University Of Technology Gothenburg, Sweden, who contributed their code to the Rodinia benchmark suite. The related paper can be found [[http:// | ||
+ | |||
+ | Initially, a parallel bucketsort splits the list into enough sublists then to be sorted in parallel using merge-sort. The parallel bucketsort, implemented in NVIDIA’s CUDA, utilizes the synchronization mechanisms, such as atomic increment, that is available on modern GPUs. |