We describe the design of high-performance parallel radix sort and merge sort routines for
manycore GPUs, taking advantage of the full programmability offered by CUDA. Our radix …

This paper presents a comprehensive performance comparison between CUDA and
OpenCL. We have selected 16 benchmarks ranging from synthetic applications to real-world …

We present a novel design and implementation of relational join algorithms for new-
generation graphics processing units (GPUs). The most recent GPU features include support …

We present a novel external sorting algorithm using graphics processors (GPUs) on large
databases composed of billions of records and wide keys. Our algorithm uses the data …

Sort is a fundamental kernel used in many database operations. In-memory sorts are now
feasible; sort performance is limited by compute flops and main memory bandwidth rather …

We have implemented three parallel sorting algorithms on the Connection Machine
Supercomputer model CM-2: B atcher's bitonic sort, a parallel radix sor~ and a sample sort …

The need to rank and order data is pervasive, and many algorithms are fundamentally
dependent upon sorting and partitioning operations. Prior to this work, GPU stream …

This poster presents efficient strategies for sorting large sequences of fixed-length keys (and
values) using GPGPU stream processors. Compared to the state-of-the-art, our radix sorting …

Most previous research into vector architectures has concentrated on supercomputing
applications and small enhancements to existing vector supercomputer implementations …

We present a taxonomy and modular implementation approach for data-parallel
accelerators, including the MIMD, vector-SIMD, subword-SIMD, SIMT, and vector-thread (VT) …