Optimized N-deque partition dual-deque merge string sorting algorithm (opens in new tab)

String sorting is a fundamental operation in various data-intensive applications, ranging from bioinformatics to database indexing. However, parallelizing string sorting remains challenging due to irregular memory access patterns, which often lead to inefficient cache utilization. This paper introduces the Parallel N-Deque Partition Dual-Deque Merge string sorting algorithm, which is evaluated against several state-of-the-art parallel sorting techniques. It utilizes a parallel block-based par...