首页> 外文会议>2012 ASE International Conference on BioMedical Computing >Performance Analyses of a Parallel Verlet Neighbor List Algorithm for GPU-Optimized MD Simulations
【24h】

Performance Analyses of a Parallel Verlet Neighbor List Algorithm for GPU-Optimized MD Simulations

机译:GPU优化的MD仿真的并行Verlet邻居列表算法的性能分析

获取原文
获取原文并翻译 | 示例

摘要

Molecular dynamics (MD) simulations provide a molecular-resolution physical description of the folding and assembly processes, but the size and the timescales of simulations are limited because the underlying algorithm is computationally demanding. We recently introduced a parallel neighbor list algorithm that was specifically optimized for MD simulations on GPUs. In our present study, we analyze the performance of the algorithm in our MD simulation software, and we observe that the major of the overall execution time is spent performing the force calculations and the evaluation of the neighbor list and pair lists. The overall speedup of the GPU-optimized MD simulations as compared to the CPU-optimized version is N-dependent and ~30x for the full 70s ribosome (10,219 beads). The pair and neighbor list evaluations have performance speedups of ~25x and ~55x, respectively. We then make direct How biomolecules fold and assemble into well-defined structures that correspond to cellular functions is a fundamental problem in biophysics with direct biomedical application because some functions lead to diseases such as Alzheimer's, Parkinson's, and cancer. Molecular dynamics (MD) simulations provide a molecular-resolution physical description of the folding and assembly processes, but the computational demands of the algorithms restrict the size and the timescales one can simulate. In a recent study, we introduced a parallel neighbor list algorithm that was specifically optimized for MD simulations on GPUs. We now analyze the performance of our MD simulation code that incorporates the algorithm, and we observe that the force calculations and the evaluation of the neighbor list and pair lists constitutes a majority of the overall execution time. The overall speedup of the GPU-optimized MD simulations as compared to the CPU-optimized version is N-dependent and ~30x for the full 70s ribosome (10,219 beads). The pair and neighbor list evaluations have performance speedups of ~- 5x and ~55x, respectively. We then make direct comparisons with the performance of our MD simulation code with that of the SOP model implemented in the simulation code of HOOMD, a leading general particle dynamics simulation package that is specifically optimized for GPUs.
机译:分子动力学(MD)模拟提供了折叠和组装过程的分子分辨率物理描述,但是模拟的大小和时间尺度是有限的,因为基础算法在计算上要求很高。我们最近推出了一种并行邻居列表算法,该算法专门针对GPU上的MD仿真进行了优化。在我们目前的研究中,我们在MD仿真软件中分析了算法的性能,并观察到,整个执行时间的主要时间用于执行力计算以及对邻居列表和对列表的评估。与CPU优化版本相比,GPU优化MD仿真的总体速度取决于N,对于整个70年代的核糖体(10,219个珠子),速度的提高约为30倍。对和邻居列表评估的性能分别提高了约25倍和约55倍。然后,我们直接研究生物分子如何折叠并组装成与细胞功能相对应的明确结构,这是直接生物医学应用在生物物理学中的一个基本问题,因为某些功能会导致疾病,例如老年痴呆症,帕金森氏症和癌症。分子动力学(MD)模拟提供了折叠和组装过程的分子分辨率物理描述,但是算法的计算需求限制了人们可以模拟的大小和时间范围。在最近的研究中,我们引入了并行邻居列表算法,该算法专门针对GPU上的MD仿真进行了优化。现在,我们分析包含该算法的MD仿真代码的性能,并观察到力计算以及邻居列表和对列表的评估构成了整个执行时间的大部分。与CPU优化版本相比,GPU优化MD仿真的总体速度取决于N,对于整个70年代的核糖体(10,219个珠子),速度的提高约为30倍。对和邻居列表评估的性能分别提高了约5倍和55倍。然后,我们将我们的MD模拟代码的性能与HOOMD的模拟代码中实现的SOP模型的性能进行直接比较,HOOMD是专门针对GPU优化的领先的通用粒子动力学模拟软件包。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号