Highly-scalable, highly-performant and highly-practical sparse matrix computations: progress and challenges. (Chinese. English summary) Zbl 1474.65118

Summary: Sparse matrix algorithms are one of the most challenging topics in the supercomputing area. This paper from three aspects, i.e., high scalability, high performance and high practicability, provides an overview of the most important research work published in the last 30 years. Then a large amount of experimental results from evaluating over ten sparse BLAS algorithms on three GPUs are analyzed, and the difficulties of getting the three achievements are discussed. Finally, a serial of challenges of the next generation sparse matrix computations are proposed.


65F50 Computational methods for sparse matrices
65Y05 Parallel numerical computation
65Y10 Numerical algorithms for specific classes of architectures