KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Extreme Computing Research Center
Permanent link to this recordhttp://hdl.handle.net/10754/564624
MetadataShow full item record
AbstractThis paper describes a task parallel implementation of ExaFMM, an open source implementation of fast multipole methods (FMM), using a lightweight task parallel library MassiveThreads. Although there have been many attempts on parallelizing FMM, experiences have almost exclusively been limited to formulation based on flat homogeneous parallel loops. FMM in fact contains operations that cannot be readily expressed in such conventional but restrictive models. We show that task parallelism, or parallel recursions in particular, allows us to parallelize all operations of FMM naturally and scalably. Moreover it allows us to parallelize a ''mutual interaction'' for force/potential evaluation, which is roughly twice as efficient as a more conventional, unidirectional force/potential evaluation. The net result is an open source FMM that is clearly among the fastest single node implementations, including those on GPUs; with a million particles on a 32 cores Sandy Bridge 2.20GHz node, it completes a single time step including tree construction and force/potential evaluation in 65 milliseconds. The study clearly showcases both programmability and performance benefits of flexible parallel constructs over more monolithic parallel loops. © 2012 IEEE.
CitationTaura, K., Nakashima, J., Yokota, R., & Maruyama, N. (2012). A Task Parallel Implementation of Fast Multipole Methods. 2012 SC Companion: High Performance Computing, Networking Storage and Analysis. doi:10.1109/sc.companion.2012.86
Conference/Event name2012 SC Companion: High Performance Computing, Networking Storage and Analysis, SCC 2012