Analyzing GPU Tensor Core Potential for Fast Reductions

Abstract

The Nvidia GPU architecture has introduced new computing elements such as the \textit{tensor cores}, which are special processing units dedicated to perform fast matrix-multiply-accumulate (MMA) operations and accelerate \textit{Deep Learning} applications. In this work we present the idea of using tensor cores for a different purpose such as the parallel arithmetic reduction problem, and propose a new GPU tensor-core based algorithm as well as analyze its potential performance benefits in comparison to a traditional GPU-based one. The proposed method, encodes the reduction of $n$ numbers as a set of $m\times m$ MMA tensor-core operations (for Nvidia's Volta architecture $m=16$) and takes advantage from the fact that each MMA operation takes just one GPU cycle. When analyzing the cost under a simplified GPU computing model, the result is that the new algorithm manages to reduce a problem of $n$ numbers in $T(n)=5{\log }_{m^2}(n)$ steps with a speedup of $S=\frac{4}{5}{\log }_2(m^2)$.

This paper was presented in the SCCC 2018 Conference, November 5

References in corpus (5)

• Deep Learning in Neural Networks: An Overview
• NVIDIA Tensor Core Programmability, Performance & Precision
• GPU-based fast Monte Carlo simulation for radiotherapy dose calculation
• Adaptive Multi-GPU Exchange Monte Carlo for the 3D Random Field Ising Model
• GPU parallel simulation algorithm of Brownian particles with excluded volume using Delaunay triangulations