Using state-of-the-art sparse matrix optimizations for accelerating the performance of multiphysics simulations

Authors:
Vasileios Karakasis;Georgios Goumas;Konstantinos Nikas;Nectarios Koziris;Juha Ruokolainen;Peter Råback
Affiliations:
National Technical University of Athens, Greece;National Technical University of Athens, Greece;National Technical University of Athens, Greece;National Technical University of Athens, Greece;CSC - IT Center for Science Ltd., Finland;CSC - IT Center for Science Ltd., Finland
Venue:
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
Year:
2012

Citing 3
Cited 0

Improving performance of sparse matrix-vector multiplication

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Performance evaluation of the sparse matrix-vector multiplication on modern architectures

The Journal of Supercomputing
CSX: an extended compression format for spmv on shared memory systems

Proceedings of the 16th ACM symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiphysics simulations are at the core of modern Computer Aided Engineering (CAE) allowing the analysis of multiple, simultaneously acting physical phenomena. These simulations often rely on Finite Element Methods (FEM) and the solution of large linear systems which, in turn, end up in multiple calls of the costly Sparse Matrix-Vector Multiplication (SpM×V) kernel. The major--and mostly inherent--performance problem of the this kernel is its very low flop:byte ratio, meaning that the algorithm must retrieve a significant amount of data from the memory hierarchy in order to perform a useful operation.