GPU加速混合树算法在无碰撞N体模拟中的应用
GPU accelerated Hybrid Tree Algorithm for Collision-less N-body Simulations
摘要:
本文提出了一种混合树算法,用于减少无碰撞N体模拟的计算和通信开销。该算法的基本思想是将相互作用力分解为两部分:来自相邻粒子的硬作用力和来自远处粒子的软作用力,并对这两种作用力进行不同的时间积分。对于硬力计算,由于只需要近邻粒子的数据,可以有效地减少并行树代码的计算和通信开销。我们在GPU集群上实现了该算法,以加速硬力和软力的力计算。由于在GPU集群上实现了该算法,我们能够将通信开销和总执行时间分别减少到正常树算法的40%和80%。此外,减少因子相对正常树算法是较小的大量进程,我们预计,执行时间最终可以减少到正常树算法的70%左右。
英文摘要:
We propose a hybrid tree algorithm for reducing calculation and communication cost of collision-less N-body simulations. The concept of our algorithm is that we split interaction force into two parts: hard-force from neighbor particles and soft-force from distant particles, and applying different time integration for the forces. For hard-force calculation, we can efficiently reduce the calculation and communication cost of the parallel tree code because we only need data of neighbor particles for this part. We implement the algorithm on GPU clusters to accelerate force calculation for both hard and soft force. As the result of implementing the algorithm on GPU clusters, we were able to reduce the communication cost and the total execution time to 40% and 80% of that of a normal tree algorithm, respectively. In addition, the reduction factor relative the normal tree algorithm is smaller for large number of processes, and we expect that the execution time can be ultimately reduced down to about 70% of the normal tree algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。