Efficient AMG on heterogeneous systems

Authors:
Jiri Kraus;Malte Förster
Affiliations:
Fraunhofer Institute for Algorithms and Scientific Computing SCAI, Sankt Augustin, Germany;Fraunhofer Institute for Algorithms and Scientific Computing SCAI, Sankt Augustin, Germany
Venue:
Facing the Multicore-Challenge II
Year:
2012

Citing 5
Cited 1

C++ Templates

C++ Templates
Parallel multigrid preconditioning on graphics processing units (GPUs) for robust power grid analysis

Proceedings of the 47th Design Automation Conference
Programming Massively Parallel Processors: A Hands-on Approach

Programming Massively Parallel Processors: A Hands-on Approach
Scalable parallel AMG on ccNUMA machines with OpenMP

Computer Science - Research and Development
A parallel algebraic multigrid solver on graphics processing units

HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications

Using LAMA for efficient AMG on hybrid clusters

Computer Science - Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many numerical simulation codes the backbone of the application covers the solution of linear systems of equations. Often, being created via a discretization of differential equations, the corresponding matrices are very sparse. One popular way to solve these sparse linear systems are multigrid methods - in particular AMG - because of their numerical scalability. As the memory bandwidth is usually the bottleneck of linear solvers for sparse systems they especially benefit from high throughput architectures like GPUs. We will show that this is true even for a rather complex hierarchical method like AMG. The presented benchmarks are all based on the new open source library LAMA and compare the run times on different GPUs to those of an efficient OpenMP parallel CPU implementation. As the memory access pattern is especially crucial for GPUs we have a focus on the performance of different sparse matrix formats.