Algorithmic strategies for optimizing the parallel reduction primitive in CUDA

Many general-purpose applications exploit Graphics Processing Units (GPUs) by executing a set of well-known dataparallel primitives. Those primitives are usually invoked from the host many times, so their throughput has a great impact on the performance of the overall system. Thus, the study of nove...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 International Conference on High Performance Computing and Simulation s. 511 - 519
Hlavní autoři: Martin, P. J., Ayuso, L. F., Torres, R., Gavilanes, A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2012
Témata:
Arrays
CUDA
data-parallel algorithms
GPGPU
Graphics processing unit
Instruction sets
Kernel
Optimization
parallel reduction
segmented parallel reduction
Synchronization
Throughput
ISBN:9781467323598, 1467323594
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Many general-purpose applications exploit Graphics Processing Units (GPUs) by executing a set of well-known dataparallel primitives. Those primitives are usually invoked from the host many times, so their throughput has a great impact on the performance of the overall system. Thus, the study of novel algorithmic strategies to optimize their implementation on current devices is an interesting topic to the GPU community. In this paper we focus on optimizing the reduction primitive, which merely reduces a data sequence into a single value using a binary associative operator. Although tree-based and sequential-based algorithms have been already implemented on GPUs, a comparison of both algorithm performance had not been carried out yet. Thus, our first contribution is to present an experimental study of state-of-the-art reduction algorithms on CUDA. Next we introduce two algorithmic optimizations that are integrated into the fastest solution (a sequential-based algorithm), improving its throughput even more. Finally, we replicate this methodology to the segmented version of the primitive, which applies when the input is composed of several independent segments. In this case, it is not clear which algorithm exhibits the best performance, since throughput deeply depends on the distribution of segments along the input. According to our results, tree-based algorithms run faster for small segments, while sequential methods are better for medium and large ones.
ISBN:9781467323598
1467323594
DOI:10.1109/HPCSim.2012.6266966