A parallel algebraic multigrid solver on graphics processing units

54Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper presents a multi-GPU implementation of the preconditioned conjugate gradient algorithm with an algebraic multigrid preconditioner (PCG-AMG) for an elliptic model problem on a 3D unstructured grid. An efficient parallel sparse matrix-vector multiplication scheme underlying the PCG-AMG algorithm is presented for the many-core GPU architecture. A performance comparison of the parallel solver shows that a singe Nvidia Tesla C1060 GPU board delivers the performance of a sixteen node Infiniband cluster and a multi-GPU configuration with eight GPUs is about 100 times faster than a typical server CPU core. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Haase, G., Liebmann, M., Douglas, C. C., & Plank, G. (2010). A parallel algebraic multigrid solver on graphics processing units. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5938 LNCS, pp. 38–47). Springer Verlag. https://doi.org/10.1007/978-3-642-11842-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free