首页> 外文会议>High-performance computing and networking >Parallelization of the molecular dynamics code GROMOS87 for distributed memory parallel architectures
【24h】

Parallelization of the molecular dynamics code GROMOS87 for distributed memory parallel architectures

机译:分子动力学代码GROMOS87的并行化,用于分布式内存并行体系结构

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

摘要

This paper describes the techniques and methodologies employed during parallelization of the Molecular Dynamics (MD) code GROMOS87, with the specific requirement that the program run efficiently on a range of distributed-memory parallel platforms. We discuss the preliminary results of our parallel port and indicate to what extent we are able to satisfy the basic requirements of industrial users with regard to code performance and scalability. We introduce a scheme which is used to dynamically allocate charge groups to processors reducing the time imbalance during the non-bonded force calculation phase from 30 - 40% to < 1%. We propose a new method for parallelizing the constraint dynamics algorithm (SHAKE) where the emphasis is placed on reducing the number and size of communicated packets during the iterative SHAKEing process.
机译:本文介绍了分子动力学(MD)代码GROMOS87并行化过程中采用的技术和方法,具体要求是该程序必须在一系列分布式内存并行平台上有效运行。我们讨论了并行端口的初步结果,并指出在何种程度上我们能够满足工业用户在代码性能和可伸缩性方面的基本要求。我们引入了一种方案,该方案用于将电荷组动态分配给处理器,从而将非结合力计算阶段的时间不平衡从30%降低到40%到<1%。我们提出了一种用于并行化约束动力学算法(SHAKE)的新方法,其中重点放在在迭代SHAKEING过程中减少通信数据包的数量和大小。

著录项

  • 来源
  • 会议地点 Milan(IT);Milan(IT)
  • 作者单位

    University of Southampton Parallel Applications Centre, 2 Venture Road, Chilworth Research Centre, Southampton S016 7NP, UK;

    University of Southampton Parallel Applications Centre, 2 Venture Road, Chilworth Research Centre, Southampton S016 7NP, UK;

    Department of Biophysical Chemistry, University of Groningen, Nijenborgh 4, 9747 AG Groningen, The Netherlands;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 TQ4;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号