Video: Increasing Efficiency of Sparse Matrix-Matrix Multiplication
by Rich Brueckner from High-Performance Computing News Analysis | insideHPC on (#2VY2G)
"Given the importance of the precise sparsity pattern, and even the actual matrix data, which decides the effective fill-in upon multiplication, the tests are performed within the CP2K package with application benchmarks. Results show a substantial boost in performance for the RMA based 2.5D algorithm, up to 1.80x, which is observed to increase with the number of processes involved in the parallelization."
The post Video: Increasing Efficiency of Sparse Matrix-Matrix Multiplication appeared first on insideHPC.