KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Settings

Author: search.filters.author.Kittitornkun, SurinSubject: search.filters.subject.Partition

Search Results

Now showing 1 - 4 of 4
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Item,
    Optimizing MultiStack parallel (MSP) sorting algorithm
    (2021-06-02)
    Rattanatranurak, Apisit
    ;
    Kittitornkun, Surin
    Mobile smartphones/laptops are becoming much more powerful in terms of core count and memory capacity. Demanding games and parallel applications/algorithms can hopefully take advantages of the hardware. Our parallel MSPSort algorithm is one of those examples. However, MSPSort can be optimized and fine tuned even further to achieve its highest capabilities. To evaluate the effectiveness of MSPSort, two Linux systems are quad core ARM Cortex-A72 and 24-core AMD ThreadRipper R9-2920. It has been demonstrated that MSPSort is comparable to the well-known parallel standard template library sorting functions, i.e. Balanced QuickSort and Multiway MergeSort in various aspects such as run time and memory requirements.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Item,
    A MultiStack Parallel (MSP) partition algorithm applied to sorting
    (2020-09-09)
    Rattanatranurak, Apisit
    ;
    Kittitornkun, Surin
    The CPUs of smartphones are becoming multicore with huge RAM and storage to support a variety of multimedia applications in the near future. A MultiStack Parallel (MSP) sorting algorithm is proposed and named MSPSort to support manycore systems. It can be regarded as many threads of single-pivot interleaving block-based Hoare’s algorithm. Each thread performs compare-swap operations between left and right (stacked and interleaved) data blocks. A number of multithreading features of OpenMP and our own optimization strategies have been utilized. To simulate those smartphones, MSPSort is fine tuned and tested on four Linux systems, e.g. Intel i7-2600, Xeon X5670, AMD R7-1700 and R9-2920. Their memory configurations can be classified as either uniform or non-uniform memory access. The statistical results are satisfied compared to parallel-mode sorting algorithms of Standard Template Library, namely Balanced QuickSort and MultiWay MergeSort. Moreover, MSPSort looks promising to be developed further to improve both run time and stability.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Item,
    A Parallel Dual-Pivot QuickSort Algorithm with Lomuto Partition
    (2018-08-21)
    Taotiamton, Surapong
    ;
    Kittitornkun, Surin
    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.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Item,
    Parallel hybrid dual pivot sorting algorithm
    (2017-11-03)
    Taotiamton, Surapong
    ;
    Kittitornkun, Surin
    Sorting 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.