KAUST DepartmentExtreme Computing Research Center
Permanent link to this recordhttp://hdl.handle.net/10754/575821
MetadataShow full item record
AbstractThe fast multipole method (FMM) is often used to accelerate the calculation of particle interactions in particle-based methods to simulate incompressible flows. To evaluate the most time-consuming kernels - the Biot-Savart equation and stretching term of the vorticity equation, we mathematically reformulated it so that only two Laplace scalar potentials are used instead of six. This automatically ensuring divergence-free far-field computation. Based on this formulation, we developed a new FMM-based vortex method on heterogeneous architectures, which distributed the work between multicore CPUs and GPUs to best utilize the hardware resources and achieve excellent scalability. The algorithm uses new data structures which can dynamically manage inter-node communication and load balance efficiently, with only a small parallel construction overhead. This algorithm can scale to large-sized clusters showing both strong and weak scalability. Careful error and timing trade-off analysis are also performed for the cutoff functions induced by the vortex particle method. Our implementation can perform one time step of the velocity+stretching calculation for one billion particles on 32 nodes in 55.9 seconds, which yields 49.12 Tflop/s.
CitationHu, Q., Gumerov, N. A., Yokota, R., Barba, L., & Duraiswami, R. (2014). Scalable Fast Multipole Accelerated Vortex Methods. 2014 IEEE International Parallel & Distributed Processing Symposium Workshops. doi:10.1109/ipdpsw.2014.110
Conference/Event name28th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2014