Task-Based FMM for Multicore Architectures

Abstract : Fast Multipole Methods (FMM) are a fundamental operation for the simulation of many physical problems. The high performance design of such methods usually requires to carefully tune the algorithm for both the targeted physics and hardware. In this paper, we propose a new approach that achieves high performance across architectures. Our method consists of expressing the FMM algorithm as a task flow and employing a state- of-the-art runtime system, StarPU, to process the tasks on the different computing units. We carefully design the task flow, the mathematical operators, their implementations as well as scheduling schemes. Potentials and forces on 200 million particles are computed in 42.3 seconds on a homogeneous 160 cores SGI Altix UV 100 and good scalability is shown.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-00911856
Contributor : Olivier Coulaud <>
Submitted on : Saturday, November 30, 2013 - 2:59:13 PM
Last modification on : Thursday, January 11, 2018 - 6:22:35 AM
Long-term archiving on : Saturday, March 1, 2014 - 4:05:14 AM

File

sisc-cpu.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Emmanuel Agullo, Bérenger Bramas, Olivier Coulaud, Eric Darve, Matthias Messner, et al.. Task-Based FMM for Multicore Architectures. SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2014, 36 (1), pp.66-93. ⟨10.1137/130915662⟩. ⟨hal-00911856⟩

Share

Metrics

Record views

585

Files downloads

427