Pronk Sander, Pouya Iman, Lundborg Magnus, Rotskoff Grant, Wesén Björn, Kasson Peter M, Lindahl Erik
Swedish eScience Research Center, Department of Theoretical Physics, KTH Royal Institute of Technology , SE-100 44 Stockholm, Sweden.
Department of Biochemistry and Biophysics, Science for Life Laboratory, Stockholm University , SE-106 91 Stockholm, Sweden.
J Chem Theory Comput. 2015 Jun 9;11(6):2600-8. doi: 10.1021/acs.jctc.5b00234.
Computational chemistry and other simulation fields are critically dependent on computing resources, but few problems scale efficiently to the hundreds of thousands of processors available in current supercomputers-particularly for molecular dynamics. This has turned into a bottleneck as new hardware generations primarily provide more processing units rather than making individual units much faster, which simulation applications are addressing by increasingly focusing on sampling with algorithms such as free-energy perturbation, Markov state modeling, metadynamics, or milestoning. All these rely on combining results from multiple simulations into a single observation. They are potentially powerful approaches that aim to predict experimental observables directly, but this comes at the expense of added complexity in selecting sampling strategies and keeping track of dozens to thousands of simulations and their dependencies. Here, we describe how the distributed execution framework Copernicus allows the expression of such algorithms in generic workflows: dataflow programs. Because dataflow algorithms explicitly state dependencies of each constituent part, algorithms only need to be described on conceptual level, after which the execution is maximally parallel. The fully automated execution facilitates the optimization of these algorithms with adaptive sampling, where undersampled regions are automatically detected and targeted without user intervention. We show how several such algorithms can be formulated for computational chemistry problems, and how they are executed efficiently with many loosely coupled simulations using either distributed or parallel resources with Copernicus.
计算化学和其他模拟领域严重依赖计算资源,但很少有问题能够有效地扩展到当前超级计算机中可用的数十万处理器,特别是对于分子动力学而言。随着新一代硬件主要提供更多的处理单元,而不是使单个单元运行得更快,这已成为一个瓶颈,模拟应用正通过越来越多地关注使用诸如自由能微扰、马尔可夫状态建模、元动力学或里程碑法等算法进行采样来解决这一问题。所有这些方法都依赖于将多个模拟的结果合并为一个单一的观测值。它们是潜在的强大方法,旨在直接预测实验可观测量,但这是以在选择采样策略以及跟踪数十到数千个模拟及其依赖性方面增加复杂性为代价的。在这里,我们描述了分布式执行框架哥白尼如何允许在通用工作流(即数据流程序)中表达此类算法。由于数据流算法明确说明了每个组成部分的依赖性,因此算法只需在概念层面进行描述,之后执行将实现最大程度的并行。全自动执行有助于通过自适应采样对这些算法进行优化,在这种情况下,欠采样区域会在无需用户干预的情况下自动被检测并作为目标。我们展示了如何针对计算化学问题制定几种这样的算法,以及如何使用哥白尼通过分布式或并行资源进行许多松散耦合的模拟来高效执行这些算法。