用Charm++异步执行快速多极子方法
Asynchronous Execution of the Fast Multipole Method Using Charm++
摘要：
分布式算法的快速多极子方法（FMM）传统上采用局部本质树（LET）通信的块同步模型，并将其与局部数据的计算重叠。这可以被视为数据聚合的极端情况，其中整个LET被一次通信。Charm++允许对通信的粒度进行更精细的控制，并且具有与我们的FMM代码结构非常匹配的异步执行模型。与以前的异步快速N体方法，如ChaNGa和PEPC的工作，目前的工作进行了直接比较，对传统的批量同步方法和异步方法，使用魅力++。此外，我们的FMM代码的串行性能比这些以前的代码好一个数量级，所以隐藏Charm++的开销更具挑战性。
英文摘要：
Fast multipole methods (FMM) on distributed mem- ory have traditionally used a bulk-synchronous model of com- municating the local essential tree (LET) and overlapping it with computation of the local data. This could be perceived as an extreme case of data aggregation, where the whole LET is communicated at once. Charm++ allows a much finer control over the granularity of communication, and has a asynchronous execution model that fits well with the structure of our FMM code. Unlike previous work on asynchronous fast N-body methods such as ChaNGa and PEPC, the present work performs a direct comparison against the traditional bulk-synchronous approach and the asynchronous approach using Charm++. Furthermore, the serial performance of our FMM code is over an order of magnitude better than these previous codes, so it is much more challenging to hide the overhead of Charm++.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
