Sunday July 25, 2010
At least this problem description didn't mention 'gouda' in the title; that would have been cheesy. To prepare for this problem, familiarize yourself with the basics of CUDA programming.
How do CPU-bound applications compare with GPGPU applications in terms of performance? How can you tell where the bottlenecks are? In this problem you are to examine the matrix-matrix multiply performance running on the CPU with matrix-matrix multiply performance running on the GPU. Perform the identical matrix-matrix multiply task on the system's GPGPU as on the CPU, and compare the results.


- CUDA SDK and Toolkit (can be found on nVidia's site here)
- nvcc compiler for CUDA (included in the CUDA toolkit)
- gcc and Intel compilers, or a proper installation with the cl compiler
- CUDA Walkthrough: Dr. Dobb's Journal


- Many articles and howto's exist on matrix multiplication in CUDA. You are free to base your solution on any howto or article that you find. However, the source code provided in the CUDA SDK is a convenient place to start.
Show solution
Challenge Resources:
©1994-2022   |   Shodor   |   Privacy Policy   |   NSDL   |   XSEDE   |   Blue Waters   |   ACM SIGHPC   |   feedback  |   facebook   |   twitter   |   rss   |   youtube   |   XSEDE Code of Conduct   |   Not Logged In. Login