Sorting is one of the most fundamental algorithms in Computer Science and a common
operation in databases not just for sorting query results but also as part of joins (ie, sort …

Data partitioning is an important primitive for in-memory data processing systems, and in
many cases it is the key performance bottleneck. This important primitive has been the focus …

Sorting is a key computational kernel in many big data applications. Most sorting
implementations focus on a specific input size, record width, and hardware configuration …

We present new sequential and parallel sorting algorithms that now represent the fastest
known techniques for a wide range of input sizes, input distributions, data types, and …

Sorting is at the core of many database operations, such as index creation, sort-merge joins,
and user-requested output sorting. As GPUs are emerging as a promising platform to …

GPUs have become a mainstream accelerator for database operations such as sorting. Most
GPU sorting algorithms are single-GPU approaches. They neither harness the full …

Graph processing, especially high-performance graph traversal, plays a more and more
important role in data analytics. The successor of Sunway TaihuLight, New Sunway, is …

State-of-the-art studies show that FPGA-based hardware merge sorters (HMSs) can achieve
superior performance compared with optimized algorithms on CPUs and GPUs. The …

We present a sorting algorithm that works in-place, executes in parallel, is cache-efficient,
avoids branch-mispredictions, and performs work O (n log n) for arbitrary inputs with high …

The emergence of high-bandwidth memory (HBM) brings new opportunities to boost the
performance of sorting acceleration on FPGAs, which was conventionally bounded by the …