Optimized Parallel Sorting of 2D Arrays Using Row-Major Division and Final Merging Strategy

In this paper, we present a novel approach to sorting 2D arrays that leverages row-major order partitioning followed by a single, parallelized merging stage. We demonstrate how this method optimizes cache usage and reduces overhead in high-performance computing environments. Our results indicate significant performance improvements compared to traditional parallel sorting techniques, particularly in large-scale datasets