TY - JOUR AU - Rattanatranurak, Apisit AU - Kittitornkun, Surin PY - 2021/06/21 Y2 - 2024/03/29 TI - Optimizing MultiStack Parallel (MSP) Sorting Algorithm JF - Journal of Mobile Multimedia JA - JMM VL - 17 IS - 4 SE - Articles DO - 10.13052/jmm1550-4646.17412 UR - https://journals.riverpublishers.com/index.php/JMM/article/view/6341 SP - 723-748 AB - <div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p>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 <a href="https://en.wikipedia.org/wiki/ARM_Cortex-A72">Cortex-A72</a> 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.</p></div></div></div> ER -