A high-performance, hybrid, and adaptive parallel sorting architecture designed in Rust. This engine leverages Rayon for work-stealing parallelism and implements dynamic profiling heuristics to ...

A client-server application written in C++ that demonstrates and benchmarks single-threaded vs multi-threaded Merge Sort across multiple simultaneous clients. The server receives integer arrays from ...

Parallel sorting algorithm optimization represents a critical area of research aimed at accelerating the arrangement of large data sets by exploiting modern multi-core and many-core architectures. By ...

Abstract: Traditional merge sort algorithms exhibit performance limitations on contemporary hardware architectures due to significant memory overhead and suboptimal use of parallel computing ...

I’m proud to share that our research paper “Hybrid Merge Sort Algorithms: A Review” has been officially published at the ICECET 2025 in Paris 🇫🇷 This work presents a comparative analysis of ...