5 papers · ranked by Valyu relevance
Mohammed Alaa Ala’anzy, Nurdaulet Tolendi, Baizhan Baubek, Abdulmohsen Algarni + 1 more
Sorting can be approached in two main ways: sequentially and in parallel. In sequential sorting, data is processed in a single-threaded manner, which can be slow for large datasets. However, parallel sorting divides the task across multiple processing units, enabling faster results by processing data simultaneously.…
Mohammad Abdur Rob, Md. Zakir Hossen, Md. Kamal Hossen, Md. Mithun Ali + 2 more
Sorting algorithms play a crucial role in computing, but most are designed with rigid structure that are only efficient under certain conditions. Although some sorting algorithms perform well in some circumstances, they do not perform well on some resistant platforms. This study introduces Wall-L Merge Sort, which…
Kecong Tang, Ardalan Naseri, Degui Zhi, Shaojie Zhang + 1 more
At each site indexed by k, the algorithm maintains a prefix array $P_{k}$, which encodes the co-lexicographic ordering of haplotypes based on their reversed prefixes up to the current site. Formally, let ${x_{i}}$, where $i=1$ to M, denote M haplotype sequences over N sites. At site k, the prefix array $P_{k}$ is…
Julia Golonka, Filip Krużel, Rosario Schiano Lo Moriello
Resource-constrained sensor nodes in Internet-of-Things (IoT) and embedded sensing applications frequently rely on low-cost microcontrollers, where even basic algorithmic choices directly impact latency, energy consumption, and memory footprint. This study evaluates six sorting algorithms-Bubble Sort, Insertion Sort…
Sangjin Lee, Sunggon Kim, Yongseok Son, Agbotiname Lucky Imoize
We propose ScaleDefrag, a parallel and asynchronous defragmentation tool that reduces defragmentation time by up to 3.8× compared to e4defrag, while improving scalability on multi-core systems. Flash-based solid-state drives (SSDs) have been widely adopted in various large-scale storage systems including cloud and HPC…