A local parallel communication algorithm for polydisperse rigid body dynamics
Sebastian Eibl, Ulrich R\"ude

TL;DR
This paper introduces a novel parallel communication algorithm for simulating large, polydisperse rigid body systems that overcomes size restrictions and maintains high scalability on supercomputers.
Contribution
A new communication and synchronization algorithm enabling efficient parallel simulation of polydisperse particles without size restrictions.
Findings
Scalability demonstrated up to nearly two million processes.
Able to handle ten billion particles in simulations.
Effective for scenarios with large particles spanning multiple subdomains.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
