Comparison of CutShort: A Hybrid Sorting Technique Using MPI and CUDA

Many sorting algorithms have been developed over the years and the main aim is to reduce the time and space complexity for sorting the worst and average-case scenarios. Parallel computing greatly decreases the processing time and increases the processing speed. In this paper, we compare the results of a hybrid algorithm named CutShort algorithm using a parallel processing framework namely CUDA and MPI. We tested the proposed technique with random samples of large sample data. 30% speedup is achieved with parallel processing as compared to the sequential program.