11. Parallel, Distributed, and GPU Sorting

High-throughput sorting: parallel merge and quicksort, GPU bitonic and radix sort, SIMD sorting networks, and distributed partition-based sorts.

25 items

11. Parallel, distributed, and GPU sorting, 25

index slug name
311 parallel-merge-sort Parallel Merge Sort
312 parallel-quicksort Parallel Quicksort
313 parallel-sample-sort Parallel Sample Sort
314 parallel-radix-sort Parallel Radix Sort
315 parallel-bitonic-sort Parallel Bitonic Sort
316 parallel-odd-even-sort Parallel Odd Even Sort
317 parallel-counting-sort Parallel Counting Sort
318 gpu-bitonic-sort GPU Bitonic Sort
319 gpu-radix-sort GPU Radix Sort
320 gpu-merge-sort GPU Merge Sort
321 gpu-sample-sort GPU Sample Sort
322 cuda-warp-sort CUDA Warp Sort
323 cuda-block-sort CUDA Block Sort
324 simd-bitonic-sort SIMD Bitonic Sort
325 simd-sorting-network SIMD Sorting Network
326 bitonic-sorting-network Bitonic Sorting Network
327 odd-even-sorting-network Odd Even Sorting Network
328 bitonic-merge-network Bitonic Merge Network
329 mapreduce-sort MapReduce Sort
330 terasort TeraSort
331 distributed-sample-sort Distributed Sample Sort
332 distributed-range-partition-sort Distributed Range Partition Sort
333 psrs Parallel Sorting by Regular Sampling
334 bitonic-sort-on-hypercube Bitonic Sort on Hypercube
335 shear-sort Shear Sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Parallel Merge Sort

Divide the input, sort subarrays in parallel, then merge them using parallel merge procedures.
algorithms sorting parallel merge-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Parallel Quicksort

Partition the array around a pivot, then sort partitions concurrently using parallel recursion.
algorithms sorting parallel quicksort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Parallel Sample Sort

Choose splitters from samples, partition the input into buckets, sort buckets independently, then concatenate the sorted buckets.
algorithms sorting parallel sample-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Parallel Radix Sort

Sort integer keys by processing fixed width digit groups in parallel using counting and prefix sums.
algorithms sorting parallel radix-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Parallel Bitonic Sort

Sort data by building and merging bitonic sequences through a regular compare and exchange network.
algorithms sorting parallel bitonic-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Parallel Odd Even Sort

Sort an array by repeatedly comparing odd indexed and even indexed adjacent pairs in parallel.
algorithms sorting parallel odd-even-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Parallel Counting Sort

Count key frequencies in parallel, compute prefix sums, then scatter elements into sorted positions.
algorithms sorting parallel counting-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

GPU Bitonic Sort

Sort data on a GPU using a regular bitonic compare and exchange network.
algorithms sorting gpu bitonic-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

GPU Radix Sort

Sort fixed width keys on a GPU using digit passes, parallel histograms, prefix sums, and scatter operations.
algorithms sorting gpu radix-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

GPU Merge Sort

Sort data on a GPU by recursively merging sorted runs using parallel merge primitives.
algorithms sorting gpu merge-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

GPU Sample Sort

Sort data on a GPU by selecting splitters, partitioning into buckets in parallel, then sorting buckets independently.
algorithms sorting gpu sample-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

CUDA Warp Sort

Sort a small set of values inside one CUDA warp using shuffle operations and compare exchange steps.
algorithms sorting gpu cuda warp
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

CUDA Block Sort

Sort a block sized tile on the GPU using shared memory and cooperative threads.
algorithms sorting gpu cuda block-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

SIMD Bitonic Sort

Sort small vectors using SIMD registers with a fixed bitonic compare exchange network.
algorithms sorting simd bitonic-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

SIMD Sorting Network

Sort a fixed size vector by mapping a data independent sorting network to SIMD compare, shuffle, and blend operations.
algorithms sorting simd sorting-network
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Bitonic Sorting Network

Sort a fixed size sequence with a bitonic compare and exchange network whose schedule is independent of input values.
algorithms sorting sorting-network bitonic-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Odd Even Sorting Network

Sort a fixed size sequence using a data independent network of odd even compare exchange stages.
algorithms sorting sorting-network odd-even-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Bitonic Merge Network

Merge a bitonic sequence into a sorted sequence using a fixed comparator network.
algorithms sorting sorting-network bitonic-merge
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

MapReduce Sort

Sort large distributed datasets by partitioning records by key range, sorting partitions locally, and writing ordered output shards.
algorithms sorting distributed mapreduce
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

TeraSort

Sort very large datasets with range partitioning, distributed shuffle, and reducer local sorting.
algorithms sorting distributed terasort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Distributed Sample Sort

Sort data across machines by sampling keys, choosing splitters, redistributing records into ordered buckets, and sorting buckets locally.
algorithms sorting distributed sample-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Distributed Range Partition Sort

Sort distributed data by assigning fixed key ranges to workers, routing records by range, then sorting locally.
algorithms sorting distributed range-partition
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

PSRS

Sort data in parallel by local sorting, regular sampling, global splitter selection, redistribution, and final local merge.
algorithms sorting parallel psrs
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Bitonic Sort on Hypercube

Sort distributed keys across hypercube processors using dimension based compare and exchange stages.
algorithms sorting parallel distributed hypercube bitonic-sort
Wiki › Algorithms › 01. Searching and Sorting › 11. Parallel, Distributed, and GPU Sorting ›

Shear Sort

Sort a two dimensional mesh by alternating row sorts and column sorts until the grid is globally ordered.
algorithms sorting parallel mesh shear-sort