Longsheng Song
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Longsheng Song has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Hong An
University of Science and Technology of China
3 shared publications - Junshi Chen
University of Science and Technology of China
3 shared publications - Yang Zhao
University of Science and Technology of China
2 shared publications - Chao Wang
University of Science and Technology of China
1 shared publication - Dongdong Tan
University of Science and Technology of China
1 shared publication - Haijie Hou
University of Science and Technology of China
1 shared publication
Latest Publications
- 15 August 2026
- Published by Springer Nature
- p. 509-522
AtSpMV: Model-Guided Adaptive Tiling and Load Balancing for SpMV on GPUs
- 15 August 2026
- Published by Springer Nature
- p. 509-522
AtSpMV: Model-Guided Adaptive Tiling and Load Balancing for SpMV on GPUs
- 22 August 2025
- Published by Springer Nature
- p. 341-354
Uniform Dense Blocking for Efficient Sparse LU Factorization in First-Principles Materials Simulation
- 22 August 2025
- Published by Springer Nature
- p. 341-354
Uniform Dense Blocking for Efficient Sparse LU Factorization in First-Principles Materials Simulation
- Open Access
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1156-1165
DB-SpGEMM: A Massively Distributed Block-Sparse Matrix-Matrix Multiplication for Linear-Scaling DFT Calculations
Linear-scaling Math 1 density functional theory (DFT) represents a significant advancement in the field of computational materials science, especially for simulations of large systems where traditional cubic-scaling methods become computationally prohibitive. The core operation in Math 2 methods is sparse general matrix-matrix multiplication (SpGEMM), which is the major performance bottleneck. To enhance the computational efficiency of SpGEMM, it is crucial to consider the inherent sparse pattern of these matrices. Targeting block-sparse matrices with moderate block sizes and regular block shapes, we have developed a distributed block-sparse matrix-matrix multiplication (DB-SpGEMM) algorithm for large-scale DFT calculations. Through deep optimizations in distributed matrix storage, computational task decomposition, asynchronous task scheduling, and load balancing, we have implemented a linear-scaling method based on this algorithm within the discontinuous Galerkin density functional theory (DGDFT). On the new Sunway supercomputer, our approach achieves a 8 ∼ 10x speedup compared to the original version on monolayer phosphorene systems, and demonstrates superior scalability.
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1156-1165
Open AccessDB-SpGEMM: A Massively Distributed Block-Sparse Matrix-Matrix Multiplication for Linear-Scaling DFT Calculations
Linear-scaling Math 1 density functional theory (DFT) represents a significant advancement in the field of computational materials science, especially for simulations of large systems where traditional cubic-scaling methods become computationally prohibitive. The core operation in Math 2 methods is sparse general matrix-matrix multiplication (SpGEMM), which is the major performance bottleneck. To enhance the computational efficiency of SpGEMM, it is crucial to consider the inherent sparse pattern of these matrices. Targeting block-sparse matrices with moderate block sizes and regular block shapes, we have developed a distributed block-sparse matrix-matrix multiplication (DB-SpGEMM) algorithm for large-scale DFT calculations. Through deep optimizations in distributed matrix storage, computational task decomposition, asynchronous task scheduling, and load balancing, we have implemented a linear-scaling method based on this algorithm within the discontinuous Galerkin density functional theory (DGDFT). On the new Sunway supercomputer, our approach achieves a 8 ∼ 10x speedup compared to the original version on monolayer phosphorene systems, and demonstrates superior scalability.