Characterizing Scalability of Sparse Matrix-Vector Multiplications on Phytium FT-2000+ Many-cores
Donglin Chen, Jianbin Fang, Chuanfu Xu, Shizhao Chen, Zheng Wang

TL;DR
This paper investigates the scalability of sparse matrix-vector multiplication on Phytium FT-2000+ many-core architecture, providing empirical data and a regression tree-based model to guide optimization efforts for HPC applications.
Contribution
It offers the first large-scale empirical analysis of SpMV scalability on ARM-based many-core hardware and introduces a regression tree model for predicting performance.
Findings
Achieving linear speedup on Phytium FT-2000+ is challenging.
The regression tree model effectively predicts SpMV scalability.
Extensive parallelism exists but is hard to fully utilize.
Abstract
Understanding the scalability of parallel programs is crucial for software optimization and hardware architecture design. As HPC hardware is moving towards many-core design, it becomes increasingly difficult for a parallel program to make effective use of all available processor cores. This makes scalability analysis increasingly important. This paper presents a quantitative study for characterizing the scalability of sparse matrix-vector multiplications (SpMV) on Phytium FT-2000+, an ARM-based many-core architecture for HPC computing. We choose to study SpMV as it is a common operation in scientific and HPC applications. Due to the newness of ARM-based many-core architectures, there is little work on understanding the SpMV scalability on such hardware design. To close the gap, we carry out a large-scale empirical evaluation involved over 1,000 representative SpMV datasets. We show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
