并行树方法在GPU上的实现
Implementation of a Parallel Tree Method on a GPU
摘要:
kd树是计算机科学中的一个基本工具。在其他应用中,kd树搜索(通过树方法)应用于粒子相互作用和邻居搜索的快速评估是非常重要的,因为这些问题的计算复杂度从暴力方法的O(N^2)降低到树方法的O(N log N),其中N是粒子的数量。在本文中,我们提出了一个并行实现的树的方法在图形处理单元(GPU)上运行。我们提出了一个详细的描述,我们如何实现树的方法在Cypress GPU上。我们发现重要的一个优化是本地化粒子排序,以有效地利用缓存内存。我们提出了一些测试结果和性能测量。实验结果表明,在GPU上进行力计算的树遍历是可行和有效的。
英文摘要:
The kd-tree is a fundamental tool in computer science. Among other applications, the application of kd-tree search (by the tree method) to the fast evaluation of particle interactions and neighbor search is highly important, since the computational complexity of these problems is reduced from O(N^2) for a brute force method to O(N log N) for the tree method, where N is the number of particles. In this paper, we present a parallel implementation of the tree method running on a graphics processing unit (GPU). We present a detailed description of how we have implemented the tree method on a Cypress GPU. An optimization that we found important is localized particle ordering to effectively utilize cache memory. We present a number of test results and performance measurements. Our results show that the execution of the tree traversal in a force calculation on a GPU is practical and efficient.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。