A Parallel Algebraic Multigrid Preconditioned Iterative Method Based on an MPI Process Grouping Strategy for Asynchronous Concurrent Execution of the Setup and Solve Phases

Algebraic multigrid (AMG) is one of the most effective algorithms for solving large sparse linear systems and consists of a setup phase followed by a solve phase. As supercomputer performance improves and the number of MPI processes increases, AMG faces serious challenges in algorithmic scalability and parallel scalability. To address these issues, we propose an asynchronous concurrent algebraic multigrid (ACAMG) model based on an MPI process grouping strategy for setup and solve. The setup and solve phases execute asynchronously and concurrently on separate MPI process groups. This organization can both preserve AMG hierarchy quality through an appropriate choice of the setup-group size and achieve time overlap between the two phases through asynchronous concurrent execution. Based on this model, we design and implement the MPI ACAMG algorithm. Theoretical analysis and numerical experiments show that the algorithm exhibits better algorithmic and parallel scalability. For example, for a three-dimensional diffusion problem with spatially localized anisotropy, ACAMG not only reduces the solve-phase iteration count compared with the conventional method, but also achieves speedups of 4.74 and 19.36 at 64 and 128 processes, respectively.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.39303
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

A Parallel Algebraic Multigrid Preconditioned Iterative Method Based on an MPI Process Grouping Strategy for Asynchronous Concurrent Execution of the Setup and Solve Phases

冯春生, Zirui Zhu, Linjie Zhang, Shuai Liu
arXiv (Cornell University)
Matrix Theory and Algorithms
preprint

A Parallel Algebraic Multigrid Preconditioned Iterative Method Based on an MPI Process Grouping Strategy for Asynchronous Concurrent Execution of the Setup and Solve Phases

冯春生, Zirui Zhu, Linjie Zhang, Shuai Liu
preprint en

Abstract

Algebraic multigrid (AMG) is one of the most effective algorithms for solving large sparse linear systems and consists of a setup phase followed by a solve phase. As supercomputer performance improves and the number of MPI processes increases, AMG faces serious challenges in algorithmic scalability and parallel scalability. To address these issues, we propose an asynchronous concurrent algebraic multigrid (ACAMG) model based on an MPI process grouping strategy for setup and solve. The setup and solve phases execute asynchronously and concurrently on separate MPI process groups. This organization can both preserve AMG hierarchy quality through an appropriate choice of the setup-group size and achieve time overlap between the two phases through asynchronous concurrent execution. Based on this model, we design and implement the MPI ACAMG algorithm. Theoretical analysis and numerical experiments show that the algorithm exhibits better algorithmic and parallel scalability. For example, for a three-dimensional diffusion problem with spatially localized anisotropy, ACAMG not only reduces the solve-phase iteration count compared with the conventional method, but also achieves speedups of 4.74 and 19.36 at 64 and 128 processes, respectively.

arXiv (Cornell University)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon