An Empirical Assessment of Priority Queues in Event-Driven Molecular Dynamics Simulation
Computer Physics Communications, volume 92, pages 214-224, (1995)
Index
In the last decades a number of near-optimal priority queues have been developed. Many of these priority
queues are suitable for the efficient management of events generated during simulations of hard-particle
systems. In this paper we compare the execution times of the fastest priority queues known today as well
as some forms of binary search trees used as priority queues. We conclude that an unusual adaptation
of a strictly balanced binary tree has the best performance for this class of simulations.
Molecular Dynamics and Kinetic Theory Group
Physics Department
Facultad de Ciencias Físicas y Matemáticas
Universidad de Chile