Exposing fine-grained parallelism in algebraic multigrid methods

Nathan Bell, Steven Dalton, Luke N. Olson

Research output: Contribution to journalArticlepeer-review


Algebraic multigrid methods for large, sparse linear systems are a necessity in many computational simulations, yet parallel algorithms for such solvers are generally decomposed into coarse-grained tasks suitable for distributed computers with traditional processing cores. However, accelerating multigrid methods on massively parallel throughput-oriented processors, such as graphics processing units, demands algorithms with abundant fine-grained parallelism. In this paper, we develop a parallel algebraic multigrid method which exposes substantial fine-grained parallelism in both the construction of the multigrid hierarchy as well as the cycling or solve stage. Our algorithms are expressed in terms of scalable parallel primitives that are efficiently implemented on the GPU. The resulting solver achieves an average speedup of 1.8× in the setup phase and 5.7× in the cycling phase when compared to a representative CPU implementation.

Original languageEnglish (US)
Pages (from-to)C123-C152
JournalSIAM Journal on Scientific Computing
Issue number4
StatePublished - 2012


  • Algebraic multigrid
  • Graphics processing units
  • Iterative
  • Parallel
  • Sparse

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Exposing fine-grained parallelism in algebraic multigrid methods'. Together they form a unique fingerprint.

Cite this