SOLUTIONS FOR OPTIMIZING THE RADIX SORT ALGORITHMIC FUNCTION USING THE COMPUTE UNIFIED DEVICE ARCHITECTURE

Alexandru Pîrjan () and Dana-Mihaela Petroşanu ()
Additional contact information
Alexandru Pîrjan: Romanian-American University Bucharest
Dana-Mihaela Petroşanu: University Politehnica of Bucharest

Journal of Information Systems & Operations Management, 2012, vol. 6, issue 2, 344-358

Abstract: 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.

Keywords: parallel processing; CUDA; GK104; threads; shared memory (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.rebe.rau.ro/RePEc/rau/jisomg/WI12/JISOM-WI12-A11.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rau:jisomg:v:6:y:2012:i:2:p:344-358

Access Statistics for this article

More articles in Journal of Information Systems & Operations Management from Romanian-American University Contact information at EDIRC.
Bibliographic data for series maintained by Alex Tabusca ().