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. Scheduling algorithms for the revised pdpsort
Loading...
Thumbnail Image

Scheduling algorithms for the revised pdpsort

Author(s)
Rattanatranurak, Apisit
Kittitornkun, Surin
Date Issued
July 1, 2019
Type
Conference Paper
DOI
10.1109/ECTI-CON47248.2019.8955254
Abstract
Parallel sorting algorithms for manycore CPU systems are needed in data science and big data era. The PDPSort (Parallel Dual Pivot STLSort) can be revised and extended to achieve higher and more stable Speedups. This paper experiments four scheduling algorithms, Always Left (LAL), Always Right (RAL), Longer Partition First (LPF) and Shorter Partition First (SPF). Eventually, the revised PDPSort can achieve faster Speedup by upto 7.35×, 4.83× and 4.43× over the STLSort on AMD R7-1700, AMD FX-8320, and Intel i7-2600 Linux systems, respectively. Moreover, the LPF algorithm yields more stable Speedup's than others.
Citation
Proceedings of the 16th International Conference on Electrical Engineering Electronics Computer Telecommunications and Information Technology Ecti Con 2019, 65-68, 2019
Subjects

Dual pivot

Parallel openMP

Scheduling

Sort

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