Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution
From MaRDI portal
Publication:3174783
Abstract: The efficient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for common discretizations makes them a good candidate for an efficient parallel solver. Yet, modern architectures for high-performance computing systems continue to challenge the parallel scalability of multilevel solvers. While algebraic multigrid methods are robust for solving a variety of problems, the increasing importance of data locality and cost of data movement in modern architectures motivates the need to carefully exploit structure in the problem. Robust logically structured variational multigrid methods, such as Black Box Multigrid (BoxMG), maintain structure throughout the multigrid hierarchy. This avoids indirection and increased coarse-grid communication costs typical in parallel algebraic multigrid. Nevertheless, the parallel scalability of structured multigrid is challenged by coarse-grid problems where the overhead in communication dominates computation. In this paper, an algorithm is introduced for redistributing coarse-grid problems through incremental agglomeration. Guided by a predictive performance model, this algorithm provides robust redistribution decisions for structured multilevel solvers. A two-dimensional diffusion problem is used to demonstrate the significant gain in performance of this algorithm over the previous approach that used agglomeration to one processor. In addition, the parallel scalability of this approach is demonstrated on two large-scale computing systems, with solves on up to 500K+ cores.
Recommendations
- Scalable implementation of the parallel multigrid method on massively parallel computers
- Multiple coarse grid acceleration for multiscale multigrid computation
- Semicoarsening Multigrid on Distributed Memory Machines
- scientific article; zbMATH DE number 1623019
- scientific article; zbMATH DE number 1623037
- Scalable algebraic multigrid on 3500 processors
- Scalable multigrid
- An efficient coarse-grained parallel algorithm for global-local multiscale computations on massively parallel systems
- Multiscale extensions for enhancing coarse grid computations
Cites work
- scientific article; zbMATH DE number 3874483 (Why is no real title available?)
- scientific article; zbMATH DE number 1561761 (Why is no real title available?)
- scientific article; zbMATH DE number 218074 (Why is no real title available?)
- A MODEL AND IMPLEMENTATION OF MULTIGRID FOR MASSIVELY PARALLEL COMPUTERS
- A Multigrid Tutorial, Second Edition
- A massively parallel geometric multigrid solver on hierarchically distributed grids
- An optimal robust equidistribution method for two-dimensional grid adaptation based on Monge-Kantorovich optimization
- Black box multigrid
- Black box multigrid for nonsymmetric problems
- Black box multigrid with coarsening by a factor of three.
- Designing broadcasting algorithms in the postal model for message-passing systems
- Fast and robust solvers for pressure-correction in bubbly flow problems
- Matrix-dependent prolongations and restrictions in a blackbox multigrid solver
- Reducing parallel communication in algebraic multigrid through sparsification
- Scalable algebraic multigrid on 3500 processors
- The Multi-Grid Method for the Diffusion Equation with Strongly Discontinuous Coefficients
- The black box multigrid numerical homogenization algorithm
- Towards Textbook Efficiency for Parallel Multigrid
Cited in
(3)
This page was built for publication: Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174783)
