A CUDA-MPI Hybrid Bitonic Sorting Algorithm for GPU Clusters

We present a hybrid CUDA-MPI sorting algorithm that makes use of GPU clusters to sort large data sets. Our algorithm has two phases. In the first phase each node sorts a portion of the data on its GPU using a parallel bitonic sort. In the second phase the sorted subsequences are merged together in p...

Full description

Saved in:
Bibliographic Details
Main Authors: White, S., Verosky, N., Newhall, T.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Clustering algorithms
GPU clusters
Graphics processing unit
hybrid CUDA-MPI
Parallel processing
parallel sorting algorithm
Random access memory
Runtime
Sorting
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a hybrid CUDA-MPI sorting algorithm that makes use of GPU clusters to sort large data sets. Our algorithm has two phases. In the first phase each node sorts a portion of the data on its GPU using a parallel bitonic sort. In the second phase the sorted subsequences are merged together in parallel using a reduction sorting network implemented in MPI across the cluster nodes. Performance results comparing our sorting algorithm to sequential quick sort yield speed-up values of up to 9.8 for sorting 4GB of data on a 32 node GPU cluster. We anticipate even better speed-up values using our algorithm on larger data sets and larger sized clusters.
ISSN:0190-3918
2332-5690
DOI:10.1109/ICPPW.2012.82