Difference between revisions of "Hybrid Sort"

From Rodinia
Jump to: navigation, search
(New page: Sorting is a general problem widely used in computer science. Sorting can achieve high performance, taking advantage of the parallel resources in modern GPUs. Rodinia includes a sorting al...)
 
Line 2: Line 2:
  
 
We would like to acknowledge Erik Sintorn and Ulf Assarsson at Chalmers University Of Technology
 
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 at [http://doi:10.1016/j.jpdc.2008.05.012 here]  
+
Gothenburg, Sweden, who contributed their code to the Rodinia benchmark suite. The related paper can be found at [doi:10.1016/j.jpdc.2008.05.012 here]  
  
 
Initially, a parallel bucketsort splits the list into
 
Initially, a parallel bucketsort splits the list into

Revision as of 05:40, 11 February 2009

Sorting is a general problem widely used in computer science. Sorting can achieve high performance, taking advantage of the parallel resources in modern GPUs. Rodinia includes a sorting algorithm using a hybrid method.

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 at [doi:10.1016/j.jpdc.2008.05.012 here]

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.

Downloads will come soon!