Simple sorting algorithm test based on CUDA

TL;DR

This paper evaluates simple sorting algorithms like enumeration, bubble, and merge sort implemented on CUDA to analyze their performance and draw useful conclusions about their efficiency on GPU architectures.

Contribution

It introduces CUDA-based implementations of basic sorting algorithms and provides performance insights, which is a novel application for these simple algorithms.

Findings

CUDA accelerates simple sorting algorithms significantly.

Performance varies among algorithms depending on data size.

Useful conclusions on the suitability of each algorithm for GPU computing.

Abstract

With the development of computing technology, CUDA has become a very important tool. In computer programming, sorting algorithm is widely used. There are many simple sorting algorithms such as enumeration sort, bubble sort and merge sort. In this paper, we test some simple sorting algorithm based on CUDA and draw some useful conclusions.