Answers are grounded in this paper and cite their sources.
Event-driven molecular dynamics (EDMD) is the method of choice for simulating hard-particle systems, underpinning studies of phase behavior, nucleation, and glassy dynamics, as well as of non-equilibrium phenomena ranging from granular to active matter. Decades of algorithmic refinement—single-event scheduling, hybrid event calendars, and optimized neighbor searches—have reduced the computational cost per event to the point where, as we show, the dominant bottleneck for large systems is no longer arithmetic but memory-access latency: the irregular, data-dependent access pattern of event processing defeats hardware prefetching once the particle data outgrow the processor cache. We eliminate this bottleneck by exploiting a structural feature that is unique to event-driven simulation: upcoming events are encoded in the event calendar before they are processed. A multi-stage software-prefetch pipeline, staged across consecutive events so as to resolve the pointer-chasing dependency from particle pairs to their neighbor lists, overlaps DRAM transfers with useful computation. The optimization leaves the algorithm, the event ordering, and the trajectories bit-for-bit unchanged, yet accelerates simulations of hard disks and hard spheres by 15–25% for [Formula: see text] across mono- and polydisperse systems in two and three dimensions, outperforming existing EDMD codes. Our results demonstrate that hardware-aware event scheduling opens a new axis of optimization for event-driven algorithms in general.
No takes yet. Share an insight, caveat, or question.
Murase et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: