Comparing the Treecode with FMM on GPUs for vortex particle simulations of a leapfrogging vortex ring
Mechanical Engineering Department, Boston University, U.S.A.
Computers & Fluids (13 December 2010)
@article{Yokota2010,
title={“ComparingtheTreecodewithFMMonGPUsforvortexparticlesimulationsofaleapfroggingvortexring”},
journal={“Computers&Fluids”},
volume={“InPress},
number={“”},
pages={“-“},
year={“2010”},
note={“”},
issn={“0045-7930”},
doi={“DOI:10.1016/j.compfluid.2010.11.029”},
url={“http://www.sciencedirect.com/science/article/B6V26-51P9WX4-1/2/a591a645fd2584f58a320ae9294bffcf”},
author={“RioYokotaandL.A.Barba”},
keywords={“VortexRings”}
}
We compare the performance of the treecode and the fast multipole method (FMM) on GPUs. These fast algorithms are used to accelerate a vortex particle simulation of two leapfrogging vortex rings. The performance of the treecode and FMM depends strongly on the number of particles, type of hardware, distribution of particles, and the required accuracy. Our results demonstrate that for the accuracy that is required in vortex method simulations the crossover point between the treecode and FMM is around N=3,000 on the CPU. On the GPU, the treecode is able to achieve more acceleration than the FMM, and no clear crossover point is observed.
December 20, 2010 by hgpu
