A Parallel Self-consistent Field Code
A Parallel Self-consistent Field Code
复制标题
并行自洽字段代码
DOI：
10.1086/175829
复制
发表时间：
1995
期刊：
影响因子：
--
通讯作者：
G. Bryan
中科院分区：
文献类型：
--
作者：
L. Hernquist;S. Sigurdsson;G. Bryan
我们描述了一个版本的算法，不断发展的自引力粒子的集合，应该是接近理想的并行架构。我们的方法是来自“自洽场”（SCF）的方法，以前建议由Clutton-Brock和其他人。由于使用了引力场的全局描述，SCF模拟中的粒子不会直接相互作用，从而最大限度地减少了并行实现中节点之间的通信开销。实现了理想的负载平衡，因为计算每个粒子的加速度所需的操作数量完全相同。因此，SCF技术是完全可扩展的，并且可行应用的大小将与计算硬件的进步成简单比例地增长。我们描述了一个SCF代码开发和测试连接机5。实证测试表明，该算法的效率和可扩展性。根据应用程序，现在可以使用$N\sim 10 ^7 - 10^{8.5}$范围内的粒子数进行模拟。在不久的将来，更大的平台应该可以实现数十亿粒子的模拟。具体的天体物理学的应用进行了讨论的背景下，碰撞动力学。
We describe a version of an algorithm for evolving self-gravitating collections of particles that should be nearly ideal for parallel architectures. Our method is derived from the ``self-consistent field'' (SCF) approach suggested previously by Clutton-Brock and others. Owing to the use of a global description of the gravitational field, the particles in an SCF simulation do not interact with one another directly, minimizing communications overhead between nodes in a parallel implementation. Ideal load-balancing is achieved since precisely the same number of operations are needed to compute the acceleration for each particle. Consequently, the SCF technique is perfectly scalable and the size of feasible applications will grow in simple proportion to advances in computational hardware. We describe an SCF code developed for and tested on a Connection Machine 5. Empirical tests demonstrate the efficient and scalable nature of the algorithm. Depending on the application, simulations with particle numbers in the range $N\sim 10^7 - 10^{8.5}$ are now possible. Larger platforms should make simulations with billions of particles feasible in the near future. Specific astrophysical applications are discussed in the context of collisionless dynamics.