9011

Solutions For Optimizing The Radix Sort Algorithmic Function Using The Compute Unified Device Architecture

Alexandru Pirjan, Dana-Mihaela Petrosanu
Faculty of Computer Science for Business Management, Romanian-American University, 1B, Expozitiei Blvd., district 1, code 012101, Bucharest, Romania
The Proceedings of Journal ISOM Vol. 6 No. 2, 2012
@article{pirjan2012solutions,

   title={Solutions For Optimizing The Radix Sort Algorithmic Function Using The Compute Unified Device Architecture},

   author={P{^i}rjan, Alexandru and Petro{c{s}}anu, Dana-Mihaela},

   journal={Journal of Information Systems & Operations Management},

   volume={6},

   number={2},

   pages={344–358},

   year={2012},

   publisher={Romanian-American University}

}

Download Download (PDF)   View View   Source Source   

1084

views

In this paper, we have researched and developed solutions for optimizing the radix sort algorithmic function using the Compute Unified Device Architecture (CUDA). The radix sort is a common parallel primitive, an essential building block for many data processing algorithms, whose optimization improves the performance of a wide class of parallel algorithms useful in data processing. A particular interest in our research was to develop solutions for optimizing the radix sort algorithmic function that offers optimal solutions over an entire range of CUDA enabled GPUs: Tesla GT200, Fermi GF100 and the latest Kepler GK104 architecture, released on March 2012. In order to confirm the utility of the developed optimization solutions, we have extensively benchmarked and evaluated the performance of the radix sort algorithmic function in CUDA.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

* * *

* * *

Follow us on Twitter

HGPU group

1941 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

441 people like HGPU on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: