A Parallel Multi-Deque Sorting Algorithm

Simple item page
dc.contributor.authorKittitornkun, Surin
dc.contributor.authorRattanatranurak, Apisit
dc.date.accessioned2026-08-06T10:30:39Z
dc.date.available2026-08-06T10:30:39Z
dc.date.issued2021-01-01
dc.description.abstractParallel or multithreaded sorting algorithms have been proposed and researched for multicore and manycore CPU and GPU systems. Some of them are based on divide and conquer concept to exploit data parallelism as well as task parallelism at the same time. In this paper, a Multi-Deque Sort (MDQSort) is proposed and developed on top of our previous algorithm called Multi-Stack (MSP) Sort. Therefore, the MDQSort can easily enhance the performance while getting rid of weaknesses of MSPSort. As a result, MDQSort can be as competitive as the Standard Template Library parallel mode sorting algorithms on a 4-core ARM Cortex A72 Linux system in terms of run time, stability, CPU utilization and memory (RAM) utilization.
dc.identifier.citationIcsec 2021 25th International Computer Science and Engineering Conference, 1-4, 2021
dc.identifier.doi10.1109/ICSEC53205.2021.9684620
dc.identifier.other2-s2.0-85125172632
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/11520
dc.sourceIcsec 2021 25th International Computer Science and Engineering Conference
dc.subjectDeque
dc.subjectMultithread
dc.subjectOpenMP
dc.subjectParallel
dc.subjectQuickSort
dc.titleA Parallel Multi-Deque Sorting Algorithm
dc.typeConference Paper

Files

Collections

Research