首页> 外文会议>International Conference on Parallel Processing Workshops >A Special Sorting Method for Neighbor Search Procedure in Smoothed Particle Hydrodynamics on GPUs
【24h】

A Special Sorting Method for Neighbor Search Procedure in Smoothed Particle Hydrodynamics on GPUs

机译:GPU上平滑粒子流体动力学中邻居搜索过程的一种特殊排序方法

获取原文
获取外文期刊封面目录资料

摘要

Nowadays, the GPGPU technology has accelerated many physics-based simulations. SPH (Smoothed Particle Hydrodynamics) is widely used to simulate complex physical phenomena, which using neighbor search as its key procedure. Sorting and grid based method is one of the widely used neighbor search methods on the GPU. This paper presents a new special sorting method to accelerate the neighbor search procedure for SPH systems on the GPU. With our method, the sorting procedure will use the result data of the previous simulation step. Compared with the standard thrust implementation, our method can accelerate the whole simulation when the scale is not very large (nearly 2.3x speedups with 8192 particles in 16*16*16 grid size). While the scale is large, it also does not reduce the performance of the whole simulation.
机译:如今,GPGPU技术已经加速了许多基于物理的仿真。 SPH(平滑粒子流体动力学)被广泛用于模拟复杂的物理现象,该过程以邻居搜索为主要过程。基于排序和网格的方法是GPU上广泛使用的邻居搜索方法之一。本文提出了一种新的特殊排序方法,以加快GPU上SPH系统的邻居搜索过程。使用我们的方法,排序过程将使用先前模拟步骤的结果数据。与标准推力实施相比,当比例不是很大时(在16 * 16 * 16网格尺寸下,使用8192个粒子的速度提高了将近2.3倍),我们的方法可以加速整个模拟过程。尽管规模很大,但它也不会降低整个模拟的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号