The implementation on CUDA platform parallel algorithms sort the data

The relevance of this topic is due to the constant increase of the volume of the sorted data at the present time, and the demand to increase speed of information processing. The aim of this work is a modification of the known sorting algorithms for their effective use on the CUDA platform, i.e. it is necessary to develop a program parallel sorting of data to compare its performance with the sequential version and systematize the results. Thus, the obtained results show that the use of the graphics accelerator can significantly increase the speed of applications that use the algorithms sort the data. With the growth of the COP-operated arrays and the size of the used blocks of work time, multi-threaded application on a GPU is reduced several tens of times compared to the sequential implementation on the CPU, and with the increase in the number of blocks of winning increases.