Parallel hybrid dual pivot sorting algorithm

Simple item page
dc.contributor.authorTaotiamton, Surapong
dc.contributor.authorKittitornkun, Surin
dc.date.accessioned2026-08-06T10:17:46Z
dc.date.available2026-08-06T10:17:46Z
dc.date.issued2017-11-03
dc.description.abstractSorting is one of the common problems in Computer Science and data analytics. This paper presents empirical results of parallel Hybrid Dual Pivot Sort (HDPSort) for multicore/manycore CPU systems. HDPSort makes use of both classic Lomuto and Hoare partioning algorithms with two pivot values in parallel. It is developed in C++ with OpenMP 3.0 or better. HDPSort is benchmarked with the sequential STLSort in terms of run time, instruction count and branch load. The Speedups of HDPSort are up to 3.02× and 2.79× faster than the STLSort on 8-core AMD FX-8320 and 4-core Intel i7-2600 Linux systems, respectively. An indepth analysis shows that HDPSort gains the Speedup by 300% over STLSort at the expense of 1%-4% of branch mispredictions.
dc.identifier.citationEcti Con 2017 2017 14th International Conference on Electrical Engineering Electronics Computer Telecommunications and Information Technology, 377-380, 2017
dc.identifier.doi10.1109/ECTICon.2017.8096252
dc.identifier.other2-s2.0-85039914103
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/7961
dc.sourceEcti Con 2017 2017 14th International Conference on Electrical Engineering Electronics Computer Telecommunications and Information Technology
dc.subjectHoare
dc.subjectLomuto
dc.subjectMulticore
dc.subjectOpenMP
dc.subjectPartition
dc.subjectSTL Sort
dc.titleParallel hybrid dual pivot sorting algorithm
dc.typeConference Paper

Files

Collections

Research