Superscalability of the random batch Ewald method

Coulomb interaction, following an inverse-square force-law, quantifies the amount of force between two stationary and electrically charged particles. The long-range nature of Coulomb interactions poses a major challenge to molecular dynamics simulations, which are major tools for problems at the nano-/micro-scale. Various algorithms are developed to calculate the pairwise Coulomb interactions to a linear scale, but poor scalability limits the size of simulated systems. Here, we use an efficient molecular dynamics algorithm with the random batch Ewald method on all-atom systems where the complete Fourier components in the Coulomb interaction are replaced by randomly selected mini-batches. By simulating the N-body systems up to 10(8) particles using 10 000 central processing unit cores, we show that this algorithm furnishes O(N) complexity, almost perfect scalability, and an order of magnitude faster computational speed when compared to the existing state-of-the-art algorithms. Further examinations of our algorithm on distinct systems, including pure water, a micro-phase separated electrolyte, and a protein solution, demonstrate that the spatiotemporal information on all time and length scales investigated and thermodynamic quantities derived from our algorithm are in perfect agreement with those obtained from the existing algorithms. Therefore, our algorithm provides a promising solution on scalability of computing the Coulomb interaction. It is particularly useful and cost-effective to simulate ultra-large systems, which is either impossible or very costly to conduct using existing algorithms, and thus will be beneficial to a broad range of problems at nano-/micro-scales.

Automated summary

Coulomb interaction, a quantification of force between stationary and electrically charged particles, presents a challenge to molecular dynamics simulations due to its long-range nature. This study proposes an efficient algorithm using the random batch Ewald method, which improves scalability and computational speed compared to existing algorithms. The algorithm is validated on various systems and provides a promising solution for computing Coulomb interactions at nano-/micro-scales.