Weighted block-asynchronous iteration on GPU-Accelerated systems

Authors:
Hartwig Anzt;Stanimire Tomov;Jack Dongarra;Vincent Heuveline
Affiliations:
Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany;University of Tennessee, Knoxville;University of Tennessee, Knoxville, and Oak Ridge National Laboratory, Oak Ridge, and University of Manchester, Manchester, UK;Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany
Venue:
Euro-Par'12 Proceedings of the 18th international conference on Parallel processing workshops
Year:
2012

Citing 6
Cited 0

Generalized asynchronous iterations

Proc. of the conference on algorithms and hardware for parallel processing on CONPAR 86
The Run-Time Efficiency of Parallel Asynchronous Algorithms

IEEE Transactions on Computers
A unified proof for the convergence of Jacobi and Gauss-Seidel methods

SIAM Review
Timing models and local stopping criteria for asynchronous iterative algorithms

Journal of Parallel and Distributed Computing
On asynchronous iterations

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we analyze the potential of using weights for block-asynchronous relaxation methods on GPUs. For this purpose, we introduce different weighting techniques similar to those applied in block-smoothers for multigrid methods. For test matrices taken from the University of Florida Matrix Collection we report the convergence behavior and the total runtime for the different techniques. Analyzing the results, we observe that using weights may accelerate the convergence rate of block-asynchronous iteration considerably. While component-wise relaxation methods are seldom directly applied to systems of linear equations, using them as smoother in a multigrid framework they often provide an important contribution to finite element solvers. Since the parallelization potential of the classical smoothers like SOR and Gauss-Seidel is usually very limited, replacing them by weighted block-asynchronous smoothers may be beneficial to the overall multigrid performance. Due to the increase of heterogeneity in today's architecture designs, the significance and the need for highly parallel asynchronous smoothers is expected to grow.