Analysis of Parallel Scalability Bottleneck for Algebraic Multigrid in Typical Real Applications
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.
万方数据
维普
