Work

PPQSort: Pattern‐Defeating Parallel Quicksort

Year: 2026

Type: article

Abstract: ABSTRACT This paper presents PPQSort (Pattern‐defeating Parallel Quicksort), a new parallel quicksort algorithm that provides high performance and ease of use. PPQSort uses C++ threads for parallelization, achieving efficient sorting without external libraries and allowing seamless integration across different computing environments. This paper describes novel quicksort optimizations, including branchless partitioning and their scalable parallel implementation. PPQSort is compared with existing parallel quicksort algorithms on two different CPU architectures (AMD EPYC, ARM A64FX) and with 7 different synthetic input data distributions. An analysis of its cache behavior is also provided. The results of the experimental evaluation demonstrate that PPQSort is fast and robust, consistently outperforming the fastest available parallel quicksort‐based implementations for all tested inputs.

Source: Concurrency and Computation Practice and Experience

DOI: 10.1002/cpe.70673

Authors: Gabriel Hévr, Ivan Šimeček, Ondřej Voronecký

Institution: Czech Technical University in Prague

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $5,140

Funder: České Vysoké Učení Technické v Praze