User Tools

Site Tools



This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
2015-viennacl-openmp [2015/03/10 09:06]
viennastar Note on puzzles to be announced shortly
2015-viennacl-openmp [2015/03/24 20:40] (current)
viennastar Added puzzle
Line 21: Line 21:
 === Puzzles === === Puzzles ===
-Will be announced shortly.+Write a C or C++ program using OpenMP which computes the dense matrix-matrix product B = A * A for a double-precision floating point square matrix A in row-major storage (i.e. the element [i,j] is located at i*N + j in the underlying array) as fast as possible. The size of A should ​be a command line parameter of your program. Plot the obtained performance for matrix sizes between 10 and 2000 in dependence of the number of threads and comment on the results. 
 +Contact or stop by at the institute if you have questions. Submit the code with your application.
2015-viennacl-openmp.txt · Last modified: 2015/03/24 20:40 by viennastar