Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. A Parallel Dual-Pivot QuickSort Algorithm with Lomuto Partition
Loading...
Thumbnail Image

A Parallel Dual-Pivot QuickSort Algorithm with Lomuto Partition

Author(s)
Taotiamton, Surapong
Kittitornkun, Surin
Date Issued
August 21, 2018
Type
Conference Paper
DOI
10.1109/ICSEC.2017.8443883
Abstract
Sorting is one of the basic problems in computer Science and big data analytics. This paper presents a parallel Dual Pivot QuickSort (PDPSort) for manycore CPU systems. PDPSort makes use of the classic Lomuto partioning algorithm with two pivot values in parallel. It is developed in C++ and linked with OpenMP 4.5. PDPSort is compatible with the Standard Template Library sort (STLSort). The comparison includes run time, Speedup over STLSort and CPU utilization. PDPSort is faster than STLSort by 6.13×,3.54× and 2.99× on an 8-core 16-thread AMD R7-1700, an 8-core 8-thread AMD FX-8320 and a 4-core Intel i7-2600 Linux systems, respectively.
Citation
Icsec 2017 21st International Computer Science and Engineering Conference 2017 Proceeding, 282-285, 2018
Subjects

Lomuto

multi-pivot

OpenMP

Partition

QuickSort

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback