Analysis-driven engineering of comparison-based sorting algorithms on GPUs
We study the relationship between memory accesses, bank conflicts, thread multiplicity (also
known as over-subscription) and instruction-level parallelism in comparison-based sorting …
known as over-subscription) and instruction-level parallelism in comparison-based sorting …
Accelerating the unacceleratable: Hybrid CPU/GPU algorithms for memory-bound database primitives
Many database operations have a low compute to memory access ratio. In heterogeneous
systems, where a graphics processing unit (GPU) is interconnected via PCIe, the data …
systems, where a graphics processing unit (GPU) is interconnected via PCIe, the data …
Engineering worst-case inputs for pairwise merge sort on GPUs
K Berney, N Sitchinava - 2020 IEEE International Parallel and …, 2020 - ieeexplore.ieee.org
Currently, the fastest comparison-based sorting implementation on GPUs is implemented
using a parallel pairwise merge sort algorithm (Thrust library). To achieve fast runtimes, the …
using a parallel pairwise merge sort algorithm (Thrust library). To achieve fast runtimes, the …
Parallel Cache-Efficient Algorithms on GPUs
KM Berney - 2023 - search.proquest.com
Abstract Graphics Processing Units (GPUs) have emerged as a highly attractive architecture
for general-purpose computing due to their numerous programmable cores, low-latency …
for general-purpose computing due to their numerous programmable cores, low-latency …
A performance model for GPU architectures: analysis and design of fundamental algorithms
B Karsin - 2018 - scholarspace.manoa.hawaii.edu
Over the past decade,\many-core" architectures have become a crucial resources for solving
com-putationally challenging problems. These systems rely on hundreds or thousands of …
com-putationally challenging problems. These systems rely on hundreds or thousands of …
An efficient multiway mergesort for GPU architectures
Sorting is a primitive operation that is a building block for countless algorithms. As such, it is
important to design sorting algorithms that approach peak performance on a range of …
important to design sorting algorithms that approach peak performance on a range of …
A study of work distribution and contention in database primitives on heterogeneous CPU/GPU architectures
Graphics Processing Units (GPUs) provide very high on-card memory bandwidth which can
be exploited to address data-intensive workloads. To maximize algorithm throughput, it is …
be exploited to address data-intensive workloads. To maximize algorithm throughput, it is …