多分散刚体动力学的局部并行通信算法
A local parallel communication algorithm for polydisperse rigid body dynamics
摘要：
粒子大集合的模拟通常通过在空间上划分域并使用消息传递在处理相邻子域的进程之间进行通信来并行化。粒子被表示为单独的几何对象，并与子域相关联。处理子域之间的碰撞和迁移粒子，如正确的并行执行所需，需要复杂的通信协议。通常，并行化仅限于处理小于子域的粒子。然而，在许多应用中，颗粒尺寸可能变化很大，其中一些大于子域。在这篇文章中，我们提出了一个新的通信和同步算法，可以处理的并行化没有粒子的大小限制。尽管有额外的复杂性和扩展的功能，新算法只引入了最小的开销。我们展示了以前的和新的通信算法的可扩展性高达近200万个并行进程，并处理一百亿（1E10）的几何分辨粒子上的国家的最先进的千万亿次超级计算机。不同的情况下，分析新算法的性能，并证明其能力，以模拟多分散的情况下，大的单个粒子可以扩展到几个子域。
英文摘要：
The simulation of large ensembles of particles is usually parallelized by partitioning the domain spatially and using message passing to communicate between the processes handling neighboring subdomains. The particles are represented as individual geometric objects and are associated to the subdomains. Handling collisions and migrating particles between subdomains, as required for proper parallel execution, requires a complex communication protocol. Typically, the parallelization is restricted to handling only particles that are smaller than a subdomain. In many applications, however, particle sizes may vary drastically with some of them being larger than a subdomain. In this article we propose a new communication and synchronization algorithm that can handle the parallelization without size restrictions on the particles. Despite the additional complexity and extended functionality, the new algorithm introduces only minimal overhead. We demonstrate the scalability of the previous and the new communication algorithms up to almost two million parallel processes and for handling ten billion (1e10) geometrically resolved particles on a state-of-the-art petascale supercomputer. Different scenarios are presented to analyze the performance of the new algorithm and to demonstrate its capability to simulate polydisperse scenarios, where large individual particles can extend across several subdomains.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
