1153

Fast multipole methods on graphics processors

Nail A. Gumerov, Ramani Duraiswami
Perceptual Interfaces and Reality Laboratory, Computer Science and UMIACS, University of Maryland, College Park, United States
J. Comput. Phys., Vol. 227, No. 18. (10 September 2008), pp. 8290-8313.

@article{gumerov2008fast,

   title={Fast multipole methods on graphics processors},

   author={Gumerov, N.A. and Duraiswami, R.},

   journal={Journal of Computational Physics},

   volume={227},

   number={18},

   pages={8290–8313},

   issn={0021-9991},

   year={2008},

   publisher={Elsevier}

}

Download Download (PDF)   View View   Source Source   

518

views

The fast multipole method allows the rapid approximate evaluation of sums of radial basis functions. For a specified accuracy, @e, the method scales as O(N) in both time and memory compared to the direct method with complexity O(N^2), which allows the solution of larger problems with given resources. Graphical processing units (GPU) are now increasingly viewed as data parallel compute coprocessors that can provide significant computational performance at low price. We describe acceleration of the FMM using the data parallel GPU architecture. The FMM has a complex hierarchical (adaptive) structure, which is not easily implemented on data-parallel processors. We described strategies for parallelization of all components of the FMM, develop a model to explain the performance of the algorithm on the GPU architecture; and determined optimal settings for the FMM on the GPU. These optimal settings are different from those on usual CPUs. Some innovations in the FMM algorithm, including the use of modified stencils, real polynomial basis functions for the Laplace kernel, and decompositions of the translation operators, are also described. We obtained accelerations of the Laplace kernel FMM on a single NVIDIA GeForce 8800 GTX GPU in the range of 30-60 compared to a serial CPU FMM implementation. For a problem with a million sources, the summations involved are performed in approximately one second. This performance is equivalent to solving of the same problem at a 43 Teraflop rate if we use straightforward summation.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: