首页> 外文OA文献 >A Massively Parallel Barnes-Hut Tree Code with Dual Tree Traversal
【2h】

A Massively Parallel Barnes-Hut Tree Code with Dual Tree Traversal

机译:具有双重树遍历的大规模并行Barnes-Hut树代码

摘要

Hierarchical methods like the Barnes-Hut (BH) tree code and the Fast Multipole Method (FMM) are important tools to decrease the algorithmic complexity of solving the N-body problem. We report on recent efforts to achieve massive scalability on IBM BlueGene/Q and other highly concurrent supercomputers with our BH tree code PEPC by replacing a thread synchronization strategy based on traditional lock data structures with atomic operations. We also describe the integration of the Dual Tree Traversal a more recent algorithm that combines advantages of both BH tree code and FMM into PEPC. We explain how the scalability of this algorithm is influenced by the existing communication scheme and we propose a modification to achieve better distributed memory scalability.
机译:诸如Barnes-Hut(BH)树代码和Fast Multipole方法(FMM)的分层方法是降低解决N体问题的算法复杂性的重要工具。我们报告了最近的工作,以通过使用原子操作替换基于传统锁数据结构的线程同步策略,用BH树代码PEPC在IBM BlueGene / Q和其他高度并发的超级计算机上实现大规模可伸缩性。我们还描述了双重树遍历的集成,这是一种将BH树代码和FMM的优点都结合到PEPC中的最新算法。我们解释了该算法的可伸缩性如何受到现有通信方案的影响,并提出了一种改进以实现更好的分布式内存可伸缩性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号