arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.04689cs.CGcs.DC
收藏

通用网格中节点邻域的并行求解

A Parallel Solution to Finding Nodal Neighbors in Generic Meshes

Gang Mei, Nengxiong Xu, Hong Tian, Shengwei Li

摘要:

在本文中,我们专门提出了一个并行解决方案,以寻找一个环的相邻节点和元素的每个顶点在一般网格。节点邻居的发现是计算简单,但昂贵的大型网格。为了提高效率,采用了并行性,利用现代图形处理器(GPU)。所提出的并行解决方案在很大程度上依赖于并行排序,扫描和约简,并可以应用于确定相邻节点和元素。为了评估性能,将并行解决方案与相应的串行解决方案进行比较。实验结果表明:我们的并行解决方案相对于相应的串行解决方案可以分别实现大约55和90的加速比,用于找到相邻节点和元素。我们的并行解决方案是有效的,易于实现,但需要分配大的设备内存。

英文摘要:

In this paper we specifically present a parallel solution to finding the one-ring neighboring nodes and elements for each vertex in generic meshes. The finding of nodal neighbors is computationally straightforward but expensive for large meshes. To improve the efficiency, the parallelism is adopted by utilizing the modern Graphics Processing Unit (GPU). The presented parallel solution is heavily dependent on the parallel sorting, scan, and reduction, and can be applied to determine both the neighboring nodes and elements. To evaluate the performance, the parallel solution is compared to the corresponding serial solution. Experimental results show that: our parallel solution can achieve the speedups of approximately 55 and 90 over the corresponding serial solution for finding neighboring nodes and elements, respectively. Our parallel solution is efficient and easy to implement, but requires the allocation of large device memory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑