Optimizing MultiStack Parallel (MSP) Sorting Algorithm
| dc.contributor.author | Apisit Rattanatranurak | |
| dc.contributor.author | Surin Kittitornkun | |
| dc.date.accessioned | 2025-07-21T06:05:24Z | |
| dc.date.issued | 2021-06-21 | |
| dc.description.abstract | 
 
 
 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.
 
 
 | |
| dc.identifier.doi | 10.13052/jmm1550-4646.17412 | |
| dc.identifier.uri | https://dspace.kmitl.ac.th/handle/123456789/10444 | |
| dc.subject | Quicksort | |
| dc.subject | Merge sort | |
| dc.subject | Out-of-core algorithm | |
| dc.subject | Multi-core processor | |
| dc.subject.classification | Parallel Computing and Optimization Techniques | |
| dc.title | Optimizing MultiStack Parallel (MSP) Sorting Algorithm | |
| dc.type | Article |