Parallel Performance of Algebraic Multigrid Domain Decomposition (AMG-DD)
From MaRDI portal
Iterative numerical methods for linear systems (65F10) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)
Abstract: Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of communication has become a significant bottleneck that limits its scalability as processor counts continue to grow on modern machines. This paper examines the design, implementation, and parallel performance of a novel algorithm, Algebraic Multigrid Domain Decomposition (AMG-DD), designed specifically to limit communication. The goal of AMG-DD is to provide a low-communication alternative to standard AMG V-cycles by trading some additional computational overhead for a significant reduction in communication cost. Numerical results show that AMG-DD achieves superior accuracy per communication cost compared to AMG, and speedup over AMG is demonstrated on a large GPU cluster.
This page was built for publication: Parallel Performance of Algebraic Multigrid Domain Decomposition (AMG-DD)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6321036)
