Passing The Three Trillion Particle Limit With An Error-Controlled Fast Multipole Method

SESSION: Research Poster Reception

EVENT TYPE: ACM Student Research Competition Poster, Poster, Electronic Poster

TIME: 5:15 – 7:00PM

SESSION CHAIR: Bernd Mohr

AUTHORS: Ivo Kabadshow, Holger Dachsel, Jeff Hammond

ROOM: WSCC North Galleria 2nd/3rd Floors

ABSTRACT:
We present an error-controlled, highly scalable FMM implementation for long-range interactions of particle systems with open, 1D, 2D and 3D periodic boundary conditions. We highlight three aspects of fast summation codes not fully addressed in most articles; namely memory consumption, error control and runtime minimization. The aim of this poster is to contribute to all of these three points in the context of modern large scale parallel machines. Especially the used data structures, the parallelization approach and the precision-dependent parameter optimization will be discussed. The current code is able to compute all mutual long-range interactions of more than three trillion particles on 294912 BG/P cores within a few minutes for an expansion up to quadrupoles. The maximum memory footprint of such a computation has been reduced to less than 45 Bytes per particle. The code employs a one-sided, non-blocking parallelization approach with a small communication overhead.

Chair/Author Details:

Bernd Mohr (Chair) – Juelich Supercomputing Centre

Ivo Kabadshow – Forschungszentrum Juelich

Holger Dachsel – Forschungszentrum Juelich

Jeff Hammond – Argonne National Laboratory

 

Tagged with: , , , , , , , ,
Posted in Posters