RECFMM is a program representation and implementation of a recursive scheme for parallelizing the adaptive fast multipole method (FMM) on shared-memory computers. It achieves remarkable high performance while maintaining mathematical clarity and flexibility. The parallelization scheme signifies the recursion feature that is intrinsic to the FMM but was not well exploited. The program modules of RECFMM constitute a map between numerical computation components and advanced architecture mechanisms. The mathematical structure is preserved and exploited, not obscured nor compromised, by parallel rendition of the recursion scheme. Modern software system—CILK in particular, which provides graph-theoretic optimal scheduling in adaptation to the dynamics in parallel execution—is employed. RECFMM supports multiple algorithm variants that mark the major advances with low-frequency interaction kernels, and includes the asymmetrical version where the source particle ensemble is not necessarily the same as the target particle ensemble.


RECFMM can be simply built in the following steps:

> git clone
> cd recfmm
> make

RECFMM has been extensively tested with the Intel compiler toolset, although GNU and LLVM Cilk Plus compilers may also be used. In addition, RECFMM requires the scalable memory allocator scalable_calloc and scalable_free from the Threading Building Blocks template developed by Intel.



RECFMM was developed under the support of NSF grants CCF-0905164, CCF-0905473, and ACI-1440396.