Dual Parallel Partition Sorting Algorithm
Abstract— Sorting is the important algorithm which is widely used and implemented in many applications. This paper presents an efficient parallel sorting algorithm called Dual Parallel Partition sorting (DPPSort). The DPPSort partitions the data recursively and then sorts in parallel. The partitioning phase divides the data into two parts in parallel. In sorting phase, the Standard Template Library Sorting function (STLSort) and GNU sorting function (qsort) are integrated in this work. This work is developed in C/C++ language and linked with OpenMP library. In our experiments, the 4-core Intel i7-3770 with Ubuntu Linux systems is implemented. Our work is faster than qsort and STLSort function up to 5.95× and 4.70×, respectively.
Index Terms— multithreading, parallel processing, partitioning algorithm, sorting, OpenMP.
Department of Computer Engineering, Faculty of Industrial Technology, Suan Sunandha Rajabhat University, THAILAND
Cite: Apisit Rattanatranurak, "Dual Parallel Partition Sorting Algorithm," Proceedings of 2018 the 8th International Workshop on Computer Science and Engineering, pp. 685-690, Bangkok, 28-30 June, 2018.