7428

Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods

Nathan Bell, Steven Dalton, Luke N. Olson
NVIDIA Research
NVIDIA Technical Report NVR-2011-002, 2011

@techreport{Bell:AMG:NVIDIA:2011,

   author={Nathan Bell and Steven Dalton and Luke Olson},

   title={Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods},

   month={jun},

   year={2011},

   institution={NVIDIA Corporation},

   type={NVIDIA Technical Report},

   number={NVR-2011-002}

}

Download Download (PDF)   View View   Source Source   Source codes Source codes

Package:

911

views

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 on massively parallel throughput-oriented processors, such as the GPU, 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.8x in the setup phase and 5.7x in the cycling phase when compared to a representative CPU implementation.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: