Chinese Journal of Computational Physics ›› 2024, Vol. 41 ›› Issue (4): 403-417.DOI: 10.19596/j.cnki.1001-246x.8737

Previous Articles     Next Articles

Analysis of Parallel Scalability Bottleneck for Algebraic Multigrid in Typical Real Applications

Runzhang MAO1,2(), Hao DU3, Hongyun TIAN2, Silu HUANG2, Peng ZHANG2,4, Xiaowen XU2,4,*()   

  1. 1. Graduate School of China Academy of Engineering Physics, Beijing 100088, China
    2. Institute of Applied Physics and Computational Mathematics, Beijing 100094, China
    3. Kuang Yaming Honors School of Nanjing University, Nanjing, Jiangsu 210023, China
    4. Software Center for High Performance Numerical Simulation, China Academy of Engineering Physics, Beijing 100088, China
  • Received:2023-03-23 Online:2024-07-25 Published:2024-08-24
  • Contact: Xiaowen XU

Abstract:

Algebraic multigrid (AMG) is an optimal algorithm for solving large-scale sparse linear systems. However, its complexity makes it challenging to achieve ideal parallel scalability and identify parallel scalability bottlenecks. In this paper, we analyze the performance skeletons and communication patterns of the AMG algorithm to identify three categories of scalability bottlenecks. Additionally, we introduce the concept of the sparse matrix communication domain to characterize the influence of sparse patterns on parallel communication performance. We examine six typical examples with varying sparse pattern features in practical applications such as radiation fluid dynamics, structural mechanics, and aero-engines. Through our analysis, we identify and analyze multi-granularity parallel scalability bottlenecks and provide insights into future directions for improving AMG parallel performance.

Key words: algebraic multigrid, parallel preconditioning algorithms, parallel scalability, performance analysis, performance bottleneck

CLC Number: