Efficient sparse matrix-vector multiplication for geophysical electromagnetic codes on Xeon Phi coprocessors
MetadataShow full item record
Sparse matrix-vector multiplication (spMV) is a fundamental building block of iterative solvers in many scientific applications. spMV is known to perform poorly in modern processors due to excessive pressure over the memory system, overhead of irregular memory accesses and load imbalance due to non-uniform matrix structures. Achieving higher performance requires taking advantage of the features of the matrix and choosing the right sparse storage format to better exploit the target architecture. In this paper we describe an efficient spMV for geophysical electromagnetic simulations on Intel Xeon Phi coprocessors. The unique features of the matrix resulting from electromagnetic problems make it hard to handle with classical sparse storage formats. We propose a matrix decomposition and a tuned storage format that obtains a 4.13x performance improvement over the optimized CSR spMV kernel on Xeon Phi coprocessors.
Showing items related by title, author, creator and subject.
Yang, Z.; Xiang, Y.; Xie, S.; Ding, S.; Rong, Yue (2012)The problem of nonnegative blind source separation (NBSS) is addressed in this paper, where both the sources and the mixing matrix are nonnegative. Because many real-world signals are sparse, we deal with NBSS by sparse ...
Kong, L.; Sun, Jie; Tao, J.; Xiu, N. (2015)This paper is concerned with the problem of sparse recovery on Euclidean Jordan algebra (SREJA), which includes the sparse signal recovery problem and the low-rank symmetric matrix recovery problem as special cases. We ...
Zhang, X.; Pham, DucSon; Phung, D.; Liu, Wan-Quan; Saha, B.; Venkatesh, S. (2015)Many vision problems deal with high-dimensional data, such as motion segmentation and face clustering. However, these high-dimensional data usually lie in a low-dimensional structure. Sparse representation is a powerful ...