GTC ON-DEMAND

 
SEARCH SESSIONS
SEARCH SESSIONS

Search All
 
Refine Results:
 
Year(s)

SOCIAL MEDIA

EMAIL SUBSCRIPTION

 
 

GTC ON-DEMAND

Developer - Algorithms
Presentation
Media
Fast and Power Efficient Algorithms for Matrix Multiplication
Abstract:
We will present the results of of an investigation to speed up and improve power efficiency of dense matrix multiplications in CUDA. These techniques give an effective compute rate greater than the peak performance of a GPU, allowing us to approach 10 TFLOPS sustained in matrix multiplication on a single GPU. Techniques applied include exploitation of Gauss's complex multiplication algorithm and implementing a Strassen-like algorithm to reduce the computational cost from the naive O(n^3). We will discuss how the power efficiency of these dense-linear algebra computations can improved through tile size and input word size choice. Results from the Tesla K80 will show improving power efficiency is the same as improving absolute performance.
 
Topics:
Developer - Algorithms, HPC and Supercomputing
Type:
Talk
Event:
GTC Silicon Valley
Year:
2015
Session ID:
S5601
Streaming:
Share: