Parallel Priority Queues for Soft-Sphere Collision Handling
摘要
We discuss the trade-offs of hard-sphere and soft-sphere collisional simulations with a focus on the impact they have on the design options for priority queues. We then explore the efficiency of different priority queue implementations for performing soft-sphere collisional simulations. We find that a bucket priority queue that takes advantage of the temporal flexibility of the soft-sphere approach is able to achieve good scaling on sufficiently large simulations.