完全在GPU处理器上运行的稀疏八叉树引力N体代码
A sparse octree gravitational N-body code that runs entirely on the GPU processor
摘要：
我们提出了并行算法的构建和遍历稀疏八叉树的图形处理单元（GPU）。该算法是基于并行扫描和排序方法。为了测试性能和可行性，我们在CUDA中以重力树代码的形式实现了它们，该代码完全在GPU上运行。(The代码可在http：//castle.strw.learnuniv.nl/software.html公开获得）树构造和遍历算法可移植到支持CUDA或OpenCL编程语言的众核设备。重力树代码在树构造期间优于调优的CPU代码，并且总体上显示出超过20倍的性能改进，导致每秒超过280万个粒子的处理速率。
英文摘要：
We present parallel algorithms for constructing and traversing sparse octrees on graphics processing units (GPUs). The algorithms are based on parallel-scan and sort methods. To test the performance and feasibility, we implemented them in CUDA in the form of a gravitational tree-code which completely runs on the GPU.(The code is publicly available at: http://castle.strw.leidenuniv.nl/software.html) The tree construction and traverse algorithms are portable to many-core devices which have support for CUDA or OpenCL programming languages. The gravitational tree-code outperforms tuned CPU code during the tree-construction and shows a performance improvement of more than a factor 20 overall, resulting in a processing rate of more than 2.8 million particles per second.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
